arXiv:2005.10396 [math.NT]AbstractReferencesReviewsResources
Zeckendorf's Theorem Using Indices in an Arithmetic Progression
Amelia Gilson, Hadley Killen, Steven J. Miller, Nadia Razek, Joshua M. Siktar, Liza Sulkin
Published 2020-05-20Version 1
Zeckendorf's Theorem states that any positive integer can be uniquely decomposed into a sum of distinct, non-adjacent Fibonacci numbers. There are many generalizations, including results on existence of decompositions using only even indexed Fibonacci numbers. We extend these further and prove that similar results hold when only using indices in a given arithmetic progression. As part of our proofs, we generate a range of new recurrences for the Fibonacci numbers that are of interest in their own right.
Comments: 11 pages
Categories: math.NT
Related articles: Most relevant | Search more
arXiv:2006.13930 [math.NT] (Published 2020-06-24)
Distributions of Arithmetic Progressions in Piatetski-Shapiro Sequence
arXiv:2001.08634 [math.NT] (Published 2020-01-20)
When the Nontrivial, Small Divisors of a Natural Number are in Arithmetic Progression
arXiv:1912.11587 [math.NT] (Published 2019-12-25)
When the Large Divisors of a Natural Number Are in Arithmetic Progression