On the number of summands in Zeckendorf decompositions
Work
Year: 2010
Type: preprint
Abstract: Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. Once this has been shown, it's natural to ask how many summands are needed. Usi... more
Source: arXiv (Cornell University)
Cites: 6
Cited by: 39
Related to: 10
Citation percentile (by year/subfield): 99.19
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green