Search for a tool
Zeckendorf Representation

Tool to apply / check the Zeckendorf theorem stipulating that any integer can be written in the form of sum of non consecutive Fibonacci numbers also called Zeckendorf representation.

Results

Zeckendorf Representation -

Tag(s) : Arithmetics

Share
Share
dCode and more

dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!


Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!


Feedback and suggestions are welcome so that dCode offers the best 'Zeckendorf Representation' tool for free! Thank you!

Zeckendorf Representation

Zeckendorf Representation Calculator




Answers to Questions (FAQ)

What is the Zeckendorf theorem? (Definition)

Every natural integer $ n \in \mathbb {N} $ has a unique representation in the form of a sum of non-consecutive Fibonacci numbers. Its formula is written: $$ n = \sum_{i=0}^{k} \alpha_i F_{i} $$ with $ F_i $ the ith Fibonacci number, $ \alpha_i $ is a binary number $ 0 $ or $ 1 $ (a way to indicate that the number of Fibonacci is in the sum, or it is not) and $ \alpha_i \times \alpha_{i + 1} = 0 $ (a way to prevent 2 numbers consecutive Fibonacci).

This proprety is used in Fibonacci coding (a binary representation of any integer based on the values of $ \alpha_i $ in the formula above)

How to calculate a Zeckendorf representation?

Enter a value of a number $ N $ and dCode will do the calculation automatically.

Example: 10000 is the sum of $ 6765 + 2584 + 610 + 34 + 5 + 2 $, respectively the 20th, 18th, 15th, 9th, 5th and 3rd Fibonacci numbers

Algorithmically, dCode uses Binet's formula to obtain Fibonacci numbers close to a given number and subtracts them recursively until finding the Zeckendorf representation.

Source code

dCode retains ownership of the "Zeckendorf Representation" source code. Any algorithm for the "Zeckendorf Representation" algorithm, applet or snippet or script (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or any "Zeckendorf Representation" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) or any database download or API access for "Zeckendorf Representation" or any other element are not public (except explicit open source licence like Creative Commons). Same with the download for offline use on PC, mobile, tablet, iPhone or Android app.
Reminder: dCode is an educational and teaching resource, accessible online for free and for everyone.

Cite dCode

The content of the page "Zeckendorf Representation" and its results may be freely copied and reused, including for commercial purposes, provided that dCode.fr is cited as the source. Exporting the results is free and can be done simply by clicking on the export icons ⤓ (.csv or .txt format) or ⧉ (copy and paste).
To cite dCode.fr on another website, use the link: https://www.dcode.fr/zeckendorf-representation
In a scientific article or book, the recommended bibliographic citation is: Zeckendorf Representation on dCode.fr [online website], retrieved on 2025-04-16, https://www.dcode.fr/zeckendorf-representation

Need Help ?

Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!

Questions / Comments

Feedback and suggestions are welcome so that dCode offers the best 'Zeckendorf Representation' tool for free! Thank you!


https://www.dcode.fr/zeckendorf-representation
© 2025 dCode — The ultimate collection of tools for games, math, and puzzles.
 
Feedback