Garden 3: Fibonacci Sequence
This is the most exciting part of the journey! We'll be exploring an
amazing number pattern called the Fibonacci Sequence. Before we
begin, though, let's take a look at what we call a recursion
formula.
"A recursion formula allows the term of a sequence to be
determined from the previous."
tn = tn-1+3, t1=2
A recursion formula states how "tn" is related to
the previous term "tn-1". It then tells you what the first
term of the sequence is to give you the starting point.
You are then able to list the term of the sequence using the
formula. Remember, that the first term is already given:
t1=2
The term before t2 is t1, which, according
to our recursion formula, is 2. Now it's all simple substitution!
t2=t1+3
=2+3
=5
"The Fibonacci Sequence, developed by Italian mathematician
Fibonacci, can be described by the following recursion formula:"
t1=t2=1
tn=tn-1+tn-2
Using the recursion formula, the Fibonacci Sequence looks like this:
t1=1
t2=1
t3=t2+t1
=1+1
=2
t4=1+2
=3
t5=2+3
=5
t6=3+5
=8
t7=5+8
=13
t8=8+13
=21
What have you noticed? In short, the Fibonacci Sequence begins
with 1 and consists of the sum of the 2 previous terms.
{1,1,2,3,5,8,13,21,34,55,89,144,233,...}
Top of Page
There are many cool features to the Fibonacci Sequence. Check
this out:
Let's add the first 5 terms together and add an extra 1
1+1+2+3+5+1=13
...We get the 7th term of the sequence!
Let's try adding the first 6 and add 1
1+1+2+3+5+8+1=21
...It's the 8th term of the sequence!!
The pattern will always work as long as we start at the
beginning--"1". In other words, we can add the first 13 terms and 1
and we'll get the 15th term, the first 77 and 1 and get
the 79th and so on.
However, we can also skip some numbers, except that now we'll be
getting the term right after one of which we stop--DO NOT forget the
extra 1 though:
1+3+8+21+1=34
And so on.
...There's still more! Check out the following:
32 = 9
52 = 25
9 + 25 = 34
...The sum of square of a term and the square of the term after it
gives us another Fib term!
Top of Page
Fibonacii Sequence
|