The Fibonacci numbers form a sequence defined recursively by:
F(n)= 0 if n = 0;
1 if n = 1;
F(n-1)+F(n-2) if n > 1.
In other words: one starts with 0 and 1, and later produces the next Fibonacci number by adding together the two previous Fibonacci numbers. The first Fibonacci numbers for n = 0, 1, … are
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, …
The earliest known suggestion to Fibonacci numbers is contained in a book on meters by an Indian mathematician name Pingala called Chhandah-shastra (500 BC). As documented by Donald Knuth surrounded by The Art of Computer Programming, this sequence was described by the Indian mathematicians Gopala and Hemachandra contained by 1150, who were investigating the possible ways of exactly bin packing items of length 1 and 2.
As be pointed out by Johannes Kepler, the ratio of consecutive Fibonacci numbers, that is:
F(n+1)/F(n),
converges to the golden ratio φ (phi).
In simple jargon, the Fibonacci sequence begins near two pre-defined numbers, (let's use 0 and 1 as examples) and gets the subsequent number in the sequence from the sum of the previous two. So within the case above, next to 0 and 1 being the first two numbers:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946.
Monday, September 27, 2010
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment