Work

Exact Equality Cases in Kimberling's Fibonacci–Lucas Summand Conjecture

Year: 2026
Type: preprint
Abstract: 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.
Author: Newton, Tony
Language: English
Open Access status: green
OpenAlex ID: W7237001230
Cites:
Cited by:
Related to: 10