what is the recursive definition of the Fibonacci sequence: 1,1,2,3,5,8,13,21,......?
2007-04-24 17:33:48 · 6 answers · asked by Es'er fO LifE 1 in Science & Mathematics ➔ Mathematics
as everyone else has said... the sum of the previous two terms
A1=1
A2=1
An=(An-1)+(An-2)
2007-04-24 17:40:58 · answer #1 · answered by nhaisma 2 · 0⤊ 0⤋
Notice that each term starting with the third term in the Fibonacci sequence is the sum of the previous 2 terms.
So, An = A(n-1) + A(n-2)
with A1 = A2 = 1.
2007-04-25 00:38:35 · answer #2 · answered by polymac98 2 · 0⤊ 0⤋
In order to find the next number in the sequence, you add the previous two numbers.
So 1 + 1 = 2
2 + 3 = 5
5 + 3 = 8
and so on.
2007-04-25 01:09:15 · answer #3 · answered by skyblue 2 · 0⤊ 0⤋
The next number will be the sum of the previous two. Then the next number is 13+21=34.
2007-04-25 00:39:23 · answer #4 · answered by cattbarf 7 · 0⤊ 0⤋
A1 = 1
A2 = 1
A_n+1 = A_n + A_n-1 for n >= 2
2007-04-25 00:38:48 · answer #5 · answered by Anonymous · 0⤊ 0⤋
F(1)=1
F(2)=1
F(n)=F(n-1)+F(n-2) For n>2
2007-04-25 00:38:08 · answer #6 · answered by astrokid 4 · 0⤊ 0⤋