Sharp bounds for consecutive continued-fraction approximations
Continued-fraction convergents are rational approximations to a real number. The approximation coefficient rescales the absolute error by the square of the denominator. This problem asks how small or large the extrema of three consecutive coefficients can be under specified restrictions on the surrounding digits.
Why it matters and what counts as progress
Why it matters: A sharp bound describes the best possible approximation quality allowed by the digit restrictions. An inverse bound explains how close the underlying coordinates must be when the coefficient is close to its extremal value.
What counts as progress: Prove a sharp bound under a stated digit restriction and exhibit real continued fractions approaching equality. For stability estimates, specify the distance used and show that its coefficient is optimal.
How the problem developed
- 2026 · Digit-sensitive bounds for the minimum [1]
Savita S. Adhin, Ayreena Bakhtawar and Cor Kraaikamp Adhin, Bakhtawar and Kraaikamp refined Borel’s three-convergent result for runs of digit one. They proposed extensions to other digits and to the maximum.
- 19 Oct 2026 · An optimal inverse bound for the maximum [2]
JD Jones with GPT-6 Pro JD Jones’s project credits GPT-6 Pro with proposing a sharp inverse estimate for the maximum of three coefficients. It reports Lean checks for the estimate and optimality over actual triples with variable index.
AI contribution
Sharp continued-fraction bounds from exact digit runs
Gives a sharp global inverse bound for the maximum of three consecutive ordinary continued-fraction approximation coefficients. In natural-extension coordinates is at least times the maximum distance of x or y from , for real , with and . The coefficient is also optimal over actual convergent triples for integer with variable index.
Sources
Publication history
Daily emails by default, only when there’s an update.