Exact Equality Cases in Kimberling's Fibonacci–Lucas Summand Conjecture
Let 𝑉 (𝑛) count the summands in the Zeckendorf representations of the integers 1, . . . , 𝑛, andlet 𝑈 (𝑛) count those in their greedy Lucas representations. We prove Kimberling’s inequality𝑉 (𝑛) ≥ 𝑈 (𝑛) and classify every equality. Beyond eight initial cases, equality occurs at preciselytwo positions below each even-indexed Lucas number and four below each odd-indexed one.The equality-counting function is 3 log𝜙 𝑛 + 𝑂 (1), where 𝜙 is the golden ratio.
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.24409219
- Primary Topic
- Advanced Mathematical Theories and Applications
- Type
- preprint