Zeckendorf Representation (original) (raw)

Algebra Applied Mathematics Calculus and Analysis Discrete Mathematics Foundations of Mathematics Geometry History and Terminology Number Theory Probability and Statistics Recreational Mathematics Topology

Alphabetical Index New in MathWorld


The Zeckendorf representation of a positive integer n is a representation of n as a sum of nonconsecutive distinct Fibonacci numbers,

 n=sum_(k=2)^Lepsilon_kF_k,

where epsilon_k are 0 or 1 and

 epsilon_kepsilon_(k+1)=0.

Every positive integer can be written uniquely in such a form.


Explore with Wolfram|Alpha

References

Brown, J. L. Jr. "Zeckendorf's Theorem and Some Applications." Fib. Quart. 2, 163-168, 1964.Keller, T. J. "Generalizations of Zeckendorf's Theorem." Fib. Quart. 10, 95-112, 1972.Lekkerkerker, C. G. "Voorstelling van natuurlijke getallen door een som van Fibonacci." Simon Stevin 29, 190-195, 1951-52.

SeeAlso

Fibonacci Cube Graph, Zeckendorf's Theorem

References

Fraenkel, A. S. "Systems of Numeration." Amer. Math. Monthly 92, 105-114, 1985.Grabner, P. J.; Tichy, R. F.; Nemes, I.; and Pethő, A. "On the Least Significant Digit of Zeckendorf Expansions."Fib. Quart. 34, 147-151, 1996.Graham, R. L.; Knuth, D. E.; and Patashnik, O. Concrete Mathematics: A Foundation for Computer Science, 2nd ed. Reading, MA: Addison-Wesley, pp. 295-296, 1994.Vardi, I. Computational Recreations in Mathematica. Reading, MA: Addison-Wesley, p. 40, 1991.Zeckendorf, E. "Représentation des nombres naturels par une somme des nombres de Fibonacci ou de nombres de Lucas." Bull. Soc. Roy. Sci. Liège 41, 179-182, 1972.

Referenced on Wolfram|Alpha

Zeckendorf Representation

Cite this as:

Weisstein, Eric W. "Zeckendorf Representation." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/ZeckendorfRepresentation.html

Subject classifications