On representations of positive integers in the Fibonacci base

DOI10.1016/j.tcs.2004.06.025zbMath1074.11007OpenAlexW2153529280MaRDI QIDQ703551

Luca Q. Zamboni, Marcia Edson

Publication date: 11 January 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.06.025

zbMATH Keywords

Fibonacci numbersGeneralized Euclidean algorithmNumeration systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Radix representation; digital problems (11A63) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Other number representations (11A67)

Related Items (3)

Calculating the numbers of representations and the Garsia entropy in linear numeration systems ⋮ Unnamed Item ⋮ Integers with a maximal number of Fibonacci representations

Cites Work

• Unnamed Item
• Unnamed Item
• Contributions to digit expansions with respect to linear recurrences
• Combinatorial and arithmetical properties of linear numeration systems
• \(\alpha\)-expansions, linear recurrences, and the sum-of-digits function
• The Entropy of a Certain Infinitely Convolved Bernoulli Measure
• Systems of Numeration
• Representations of numbers and finite automata
• On a problem of Tamas Varga
• Odometers and systems of numeration

This page was built for publication: On representations of positive integers in the Fibonacci base