10900
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Zeckendorf Representation of Integers
This Demonstration gives the unique representation of positive integers as a sum of nonconsecutive Fibonacci numbers.
Contributed by:
Jay Warendorff
Based on an algorithm by:
David Terr
THINGS TO TRY
Slider Zoom
SNAPSHOTS
RELATED LINKS
Zeckendorf Representation
(
Wolfram
MathWorld
)
Zeckendorf's Theorem
(
Wolfram
MathWorld
)
PERMANENT CITATION
Jay Warendorff
"
Zeckendorf Representation of Integers
"
http://demonstrations.wolfram.com/ZeckendorfRepresentationOfIntegers/
Wolfram Demonstrations Project
Published: April 27, 2007
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Representations by a Sum of Squares
Michael Schreiber
Levy's Conjecture
Jay Warendorff
Fermat's 4n+1 Theorem and the n Queens Problem
Jay Warendorff
Gaussian Primes
Stephen Wolfram
Patterns in Partitions of Integers
Enrique Zeleny
Digit Counts in Integers
Stephen Wolfram
Continued Fractions
Stephen Wolfram
Instantly Periodic General Continued Fraction Representations of Square Roots
Michael Morrison
Representing an Integer with an Elementary Automaton
Michael Schreiber
Copeland-Erdos and Champernowne Numbers for Small Bases
Michael Schreiber
Related Topics
Number Theory
Representations of Numbers
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+