CONSECUTIVE GREEDY AND LAZY PELL–NIVEN NUMBERS: SHARP RUN LENGTHS AND ASYMPTOTIC CONSTANTS
We resolve two conjectures of Amiram Eldar: the maximum lengths of consecutivegreedy and lazy Pell–Niven runs are three and four, respectively. We determine the exact lead-ing orders of their counting functions: TP (X) ∼ CGX/(log X)3 and L4(X) ∼ CLX/(log X)4,with CG ≈ 0.2414787085 and CL ≈ 0.002491083723. A weight-preserving local substitution givesmodular Fourier mixing; a second substitution controls the common weight modulo fixed inte-gers. Together with exponentially bounded carry depths, these estimates reduce the constants toabsolutely convergent rational-coefficient carry series. We give rigorous truncation bounds andreproducible finite-arithmetic certificates. The asymptotics hold for arbitrary cutoffs, rather thanonly at Pell endpoints.
Authors
- Tony Newton (ORCID: https://orcid.org/0009-0009-9189-6431)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24419486
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint