We explore some properties of the so-called Zeckendorf representations of integers,
where we write an integer as a sum of distinct, nonconsecutive Fibonacci numbers.
We examine the combinatorics arising from the arithmetic of these representations,
with a particular emphasis on understanding the Zeckendorf tree that encodes
them. We introduce some possibly new results related to the tree, allowing us
to develop a partial analog to Kummer’s classical theorem about counting
the number of “carries” involved in arithmetic. Finally, we finish with some
conjectures and possible future projects related to the combinatorics of these
representations.
PDF Access Denied
We have not been able to recognize your IP address
44.201.97.138
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.