Counting base phi representations

arXiv2304.11387MaRDI QIDQ6433960FDOQ6433960

Authors: F. Michel Dekking 

Publication date: 22 April 2023

Abstract: In a base phi representation a natural number is written as a sum of powers of the golden mean $varphi$. There are many ways to do this. How many? Even if the number of powers of $varphi$ is finite, then any number has infinitely many base phi representations. By not allowing an expansion to end with the digits 0,1,1, the number of expansions becomes finite, a solution proposed by Ron Knott. Our first result is a recursion to compute this number of expansions. This recursion is closely related to the recursion given by Neville Robbins to compute the number of Fibonacci representations of a number, also known as Fibonacci partitions. We propose another way to obtain finitely many expansions, which we call the natural base phi expansions. We prove that these are closely connected to the Fibonacci partitions.

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

This page was built for publication: Counting base phi representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6433960)