Abstract
Zeckendorf's theorem states that every positive integer can be written uniquely as a sum of non-consecutive Fibonacci numbers , with initial terms . We consider the distribution of the number of summands involved in such decompositions. Previous work proved that as the distribution of the number of summands in the Zeckendorf decompositions of , appropriately normalized, converges to the standard normal. The proofs crucially used the fact that all integers in share the same potential summands. We generalize these results to subintervals of as ; the analysis is significantly more involved here as different integers have different sets of potential summands. Explicitly, fix an integer sequence . As , for almost all the distribution of the number of summands in the Zeckendorf decompositions of integers in the subintervals , appropriately normalized, converges to the standard normal. The proof follows by showing that, with probability tending to , has at least one appropriately located large gap between indices in its decomposition. We then use a correspondence between this interval and to obtain the result, since the summands are known to have Gaussian behavior in the latter interval. % We also prove the same result for more general linear recurrences.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.