On Generalized Zeckendorf Decompositions and Generalized Golden Strings

preprint2020arXivOpen access

Abstract

Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. A natural generalization of this theorem is to look at the sequence defined as follows: for n≥2n\ge 2, let Fn,1=Fn,2=⋯=Fn,n=1F_{n,1} = F_{n,2} = \cdots = F_{n,n} = 1 and Fn,m+1=Fn,m+Fn,m+1−nF_{n, m+1} = F_{n, m} + F_{n, m+1-n} for all m≥nm\ge n. It is known that every positive integer has a unique representation as a sum of Fn,mF_{n,m}'s where the indexes of summands are at least nn apart. We call this the nn-decomposition. Griffiths showed an interesting relationship between the Zeckendorf decomposition and the golden string. In this paper, we continue the work to show a relationship between the nn-decomposition and the generalized golden string.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.