Zaremba Witnesses Concentrate at
The Finding
For the smallest Zaremba witness with bound , the ratio is remarkably concentrated:
This is an extraordinarily tight band — relative width . The dominant continued fraction prefix is for 99.7% of all .
The Golden Ratio Connection
The infinite continued fraction converges to:
where is the golden ratio. The observed mean lies between the finite convergents:
The witnesses cluster in this window because the optimal CF starts with the maximum allowed quotient (5), then drops to the minimum (1), then varies — balancing the constraint of keeping all quotients while being coprime to .
Caveat on the golden ratio. The infinite CF converges to , which is 13% below the observed mean of . The witnesses are finite (typically 3–6 terms) and cluster between the low-order convergents and , not near the infinite limit. The appearance of the golden ratio is a heuristic observation about why digit 1 dominates after the leading 5 (digit 1 is the greedy choice that maximizes remaining CF flexibility), not a proven structural connection. A rigorous explanation for the concentration at remains open.
Tightness of
| Max quotient used | Frequency |
|---|---|
| 5 | 99.91% |
| 4 | 0.07% |
| 0.02% |
For 99.91% of moduli , the smallest witness requires a partial quotient of exactly 5. This does not imply that no witness with all quotients exists for those — larger witnesses may satisfy a tighter bound. The statistic measures minimal-witness tightness, not global tightness of Zaremba’s conjecture at .
Practical Impact
This observation enabled a 13x speedup in our CUDA verification kernel (v2 over v1) by starting the witness search at instead of . Note: v2 also incorporated other optimizations (loop unrolling, early-exit predicates), so the full 13x factor is not solely attributable to the starting offset.
Code
Analysis script and raw data: github.com/cahlen/idontknow
Data Availability
The complete table of pairs for to is available at github.com/cahlen/idontknow/data/zaremba-witnesses/. The file witnesses_1_100000.csv contains columns d, alpha, ratio, cf_prefix, max_quotient. SHA-256 checksum will be published alongside the dataset for independent verification.
References
- Zaremba, S.K. (1972). “La méthode des ‘bons treillis’ pour le calcul des intégrales multiples.” Applications of Number Theory to Numerical Analysis, pp. 39–119.
- Bourgain, J. and Kontorovich, A. (2014). “On Zaremba’s conjecture.” Annals of Mathematics, 180(1), pp. 137–196. arXiv:1107.3776
- Khintchine, A.Ya. (1964). Continued Fractions. University of Chicago Press.
Computed from exhaustive analysis of to on NVIDIA DGX B200.
This work was produced through human–AI collaboration (Cahlen Humphreys + Claude). Not independently peer-reviewed. All code and data open for verification at github.com/cahlen/idontknow.