the Fibonacci Sequence
-
was not important to Fibonacci and came from a problem in Liber Abbaci:[1]
A certain man put a pair of rabbits in a place surrounded by a wall. How many pairs of rabbits can be produced from that pair in a year if it is supposed that every month each pair begets a new pair which from the second month on becomes productive?
-
assumptions:
- each pair of rabbits matures and mates after 1 month
- after mating, it takes 1 more month to produce another pair of rabbits
- rabbits never die
- rabbits are always born in pairs, with one female and one male
so what happens?
-
The problem defines a sequence Fn where:
- F1 = 1,
- F2 = 1 and
- Fn = Fn-1 + Fn-2 for all natural n > 2
Notice that at any Fn in the sequence, there are Fn-1 mature rabbits and Fn-2 baby rabbits (assuming n>2).
Fibonacci Numbers
-
Are the numbers of pairs of rabbits that exist after n months along the sequence Fn corresponding to Fibonacci's rabbit exercise.
-
Can be computed via the recursive function:
F(n) = 1
F(n-1) + F(n-2)if n <= 2
if n > 2
-
Are easy to generate if you're a computer.
Don't believe me? Try typing a number in this box and hitting Calculate. (this uses a faster, non-recursive algorithm. the one above is horrible.)
so what?
-
the Fibonacci Sequence is closely related to the Golden Ratio
-
Some people claim that Fibonacci Numbers and the Golden Ratio exhibit themselves all over the place in the natural world.[2]
-
We will look into this later.
-
First, we must examine the golden ratio.
next section: the golden ratio »

