2006-11-28 07:50:39 · 5 answers · asked by : ) !@#$%^&* 2 in Science & Mathematics ➔ Mathematics
A fascinating subject.
It's recursively defined.
f(n+2) = f(n+1) + f(n) for n>0
where f(1) = f(2) = 1.
It has some really neat properties and shows up in nature.
2006-11-28 07:54:40 · answer #1 · answered by modulo_function 7 · 0⤊ 0⤋
The Fibonacci Sequence is a sequence where the sum of the two previous terms of the sequence creates the next term, with the first two terms being 0 and 1, respectively.
Fibonacci Sequence:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89...
2006-11-28 07:58:30 · answer #2 · answered by Anonymous · 0⤊ 0⤋
In mathematics, 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
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657.
2006-11-28 07:57:35 · answer #3 · answered by epaphras_faith 4 · 0⤊ 0⤋
it is f(n) = f(n-1) + f(n-2). So what you do is add the last two numbers to get the next one in th sequence. If you start with 1 you get:
1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89........
2006-11-28 07:55:13 · answer #4 · answered by Andy M 3 · 0⤊ 0⤋
112http://www.mathacademy.com/pr/prime/articles/fibonac/index.asp
add the number before it
2006-11-28 07:54:46 · answer #5 · answered by Ogbonna47 1 · 0⤊ 0⤋