Adamson's Fibonacci divisor-transform conjecture: sharp ratio errors extending Lang's formula
Extending Wolfdieter Lang's odd-Fibonacci ratio formula (OEIS A001519, COMMENTS, March 30, 2020), we prove Gary W. Adamson's conjecture, 'a(n)/a(n-1) tends to phi^2' (OEIS A130095, COMMENTS, original revision #1, May 11, 2007; retained in revision #11, December 11, 2019), where a(n)=sum_{d|n} F_(2d-1) and phi=(1+sqrt(5))/2. We obtain the sharper limits phi^(2m)*(a(2m)/a(2m-1)-phi^2) -> phi^2 and phi^(2m+1)*(a(2m+1)/a(2m)-phi^2) -> -phi^3. The proof separates the largest proper divisor from an exponentially smaller remainder. We also prove Bala's generating functions and prime congruences, and give an explicit proof of Kotešovec's previously recorded Fibonacci-transform asymptotic.
Authors
- Wenlin Zhang (ORCID: https://orcid.org/0009-0005-2414-7968)
- Haobo Ma
Institutions
- National University of Singapore (SG)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24411285
- Primary Topic
- Advanced Mathematical Theories and Applications
- Type
- preprint