Length of finite Pierce expansions

Start with positive integers b<ab < a. Replace b by the remainder when a is divided by b, and stop at zero. How long can this process last as a grows?

Why it matters and what counts as progress

Why it matters: The remainder sequence encodes a rational number’s finite Pierce expansion. A uniform bound controls the longest expansion over every starting b for a given a.

What counts as progress: Prove a uniform bound over all starting values, or construct unusually long sequences. State any assumptions on the starting value or on the sequence of quotients.

How the problem developed

  1. 2022 · First power saving below one third [1]

    Zachary Chase and Mayank Pandey Zachary Chase and Rajeev Pandey obtained an upper exponent of 1/3−2/177.

  2. 27 Oct 2026 · A lower uniform exponent [2]

    Jason Davies with AI assistance Jason Davies reported a new upper exponent near 0.294134, crediting GPT-6-Astra with the argument.

AI contribution

Hankel determinants and the length of finite Pierce expansions

Jason Davies

For integers 0<b<a0 < b < a, repeatedly replace b by the remainder of a divided by b until the value is zero. The number of positive terms is at most CεC\varepsilon a(β+ε)a^{(\beta +\varepsilon )} for every ε>0\varepsilon > 0, uniformly in b, where β=(41301−382849)/137480\beta = (41301-3\sqrt{82849})/137480, approximately 0.294134.

AI involvementAI-led
ImportanceNotable
Technical verificationFormal (Lean)
Human understandingFew
Paper date:

Sources

  1. Chase and Pandey’s prior exponent
  2. Hankel determinants and the length of finite Pierce expansions
  3. Pinned theorem, provenance and checking record
  4. Shallit’s Pierce expansion problem
Publication history