what are fibonaci series?

Answer 1

I believe it is a series of numbers where one number is the sum of the two preceding it when they're arranged in ascending order.

Answer 2

FIBONACCI is mainly:

F(t) = F(t-2) + F(t-1)

where
F(t) = 0 for t <= 0
and F(1) = 1

So,
t =0 --> F(0) = 0
t =1 --> F(1) = 1
t =2 --> F(2) = F(0) + F(1) = 0 + 1 = 1
t =3 --> F(3) = F(1) + F(2) = 1 + 1 = 2
t =4 --> F(4) = F(2) + F(3) = 1 + 2 = 3
t =5 --> F(5) = F(3) + F(4) = 2 + 3 = 5
t =6 --> F(6) = F(4) + F(5) = 3 + 5 = 8
t =7 --> F(7) = F(5) + F(6) = 5 + 8 = 13
t =8 --> F(8) = F(6) + F(7) = 8 + 13 = 21
t =9 --> F(9) = F(7) + F(8) = 13 + 21 = 34
t =10 --> F(10) = F(8) + F(9) = 21 + 34 = 55

Fib => 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...

Also, you can play with recursion if you like
Computer Science a bit.

function fibonacci( n : integer) {
if (n == 0 || n == 1) return n;
return ( fibonacci(n-1) + fibonacci(n-2) );
}

Hope this helps some.

Answer 3

In mathematics, the Fibonacci numbers form a sequence defined by the following recurrence relation:
Fibonacci numbers: F(n) = F(n-1) + F(n-2),
F(n) = 0, if n= 0
F(n) = 1, if n= 1
F(n>1) = F(n-1) + F(n-2),
F(2) = F(1) + F(0) = 0 + 1 = 1

That is, after two starting values, each number is the sum of the two preceding numbers. The first Fibonacci numbers (sequence A000045 in OEIS), also denoted as Fn, for n = 0, 1, … , are:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169

Sometimes this sequence is considered to start at F1 = 1, but it is more common to include F0 = 0.

The Fibonacci numbers are named after Leonardo of Pisa, known as Fibonacci, although they had been described earlier in India

Answer 4

Leonardo Pisano, nicknamed Fibonacci, is remembered for this problem: A man put a pair of rabbits in a place surrounded on all sides by a wall. Suppose that every month each pair begets a new pair which from the second month on become productive, and suppose that the rabbits are immortal. How many pairs of rabbits can be produced in a year?
*1st month: 1 pair
*2nd month: 1 pair
*3rd month: 2 pair
*4th month: 3 pair
and so on.
The sequence starts: 1 1 2 3 5 8 13 21 ...
This is called Fibonacci series
Each term is the sum of the previous two terms.

Answer 5

It is the "Fibonnaci" series, and it is defined as the series {1, 1, 2, 3, 5, 8, 13, 21, 34, ...}. Note how every number besides the first two are defined by the sum of the previous two numbers, for example, 21 = 8 + 13. Thus the series is defined as Fn = Fn-1 + Fn-2, for all n>=3, where "Fn" means the series F at the index n. This is called "recursive" because values in the series are found by computing the series at other indicies.

Answer 6

Fibonacci series is a series of numbers where every number in the series is the sum of previous two numbers (obviously except for the first two).

For ex:-

0, 1, 1, 2, 3, 5, 8, 13, 21,........................(if u start from 0)

or

1, 1, 2, 3, 5, 8, 13, 21,............................. (if u start from 1)


Thanks,
Dhruv

Answer 7

It's a fibonacci series, singular there is only one.
The sequence starts:
0,1,1,2,3,5,8,13, ect;

Every number in the sequence is defined as the sum of the two pervious number in the series, with the exception of the first two, which are 0 and 1.

See link for more info.

Answer 8

try looking at this site... it has a lot of explanations concerning fibonacci series

http://en.wikipedia.org/wiki/Fibonacci_number

Answer 9

bunch of numbers...mentioned on the davinci code..