Each number is the sum of the two numbers before, so if you work backwards:
a, b, c, d, e, 1, 1, 2, 3, 5, 8, 13, 21
e + 1 = 1
e = 0
d + e = 1
d + 0 = 1
d = 1
c + d = e
c + 1 = 0
c = -1
b + c = d
b + -1 = 1
b = 2
a + b = c
a + 2 = -1
a = -3
-3, 2, -1, 1, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, etc.
2007-11-20 13:09:51
·
answer #1
·
answered by Puzzling 7
·
2⤊
0⤋
there's a general formula for the nth term. If I remember corectly it is: F(n) = 1/ â5 [(1 + â5) / 2]ⁿ - 1 / â5[(1 - â5) / 2]ⁿ
So for example lets say I wanan find the 2nd term of Fibo's Sequence. N is 2.
Now
F(n) = 1/â5 [(1 + â5) / 2]² - 1/â5 [(1 - â5) / 2]²
= 1/ â5 (1/4 + (2â5)/4 + 5/4) - 1/â5 (1/4 - (2â5)/4 + 5/4)
= answer will be 1 (lol hard to type everu=ything I'll leave it down to u. You get the idea... right?)
Anyways, the first number of fibonacci is 1, I don't think there are any negatives. Check with the general formula, see if you get any answers. Hint: for first answer replace n with (-1).
2007-11-20 21:18:09
·
answer #2
·
answered by Anonymous
·
0⤊
0⤋
-3 2 -1 1 0,
keeping the same rule: Each number is
the sum of the previous 2.
Carrying this further we get the rule for the
"negative Fibonacci sequence":
F_ -n = (-1)^(n+1)*F_n.
2007-11-20 21:18:22
·
answer #4
·
answered by steiner1745 7
·
0⤊
0⤋
well, my guess would be 0,0,0,0,0
2007-11-20 21:10:34
·
answer #5
·
answered by Harris 6
·
0⤊
3⤋