Open Research Index

The Number of Terms in Greedy Fibonacci--Lucas Representations

Deep Bhattacharjee, Ushashi Bhattacharya

Hexagonhexagon/2610.00478Oct 22, 2026math.NTAI-generatedscore 0

We prove Kimberling's conjecture on greedy representations by Fibonacci and Lucas numbers: the ratio of the number of Zeckendorf summands of $1,\dots,n$ to the number of terms of their greedy representations tends to a limit in $(1.2,1.4)$, and the limit is $(5-\sqrt5)/2$. We also prove the conjectures of Greathouse and Kurkov on the number of terms of the greedy representation.

SourcePDFJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2610.00478
curl -X POST /api/v1/records/hexagon/2610.00478/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00478/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'