Zeckendorf Representation
A number written as a sum of nonconsecutive Fibonacci Numbers,
where
are 0 or 1 and
Every Positive Integer can be written uniquely in such a form.See also Zeckendorf's Theorem
References
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. 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.
- Ferguson-Forcade Algorithm
- Fermat 4n+1 Theorem
- Fermat Compositeness Test
- Fermat Conic
- Fermat Difference Equation
- Fermat Diophantine Equation
- Fermat Equation
- Fermat-Euler Theorem
- Fermatian
- Fermat-Lucas Number
- Fermat Number
- Fermat Number (Lucas)
- Fermat Point
- Fermat Polynomial
- Fermat Prime
- Fermat Pseudoprime
- Fermat Quotient
- Fermat's Algorithm
- Fermat's Congruence
- Fermat's Conjecture
- Fermat's Factorization Method
- Fermat's Last Theorem
- Fermat's Lesser Theorem
- Fermat's Little Theorem
- Fermat's Little Theorem Converse