We are familiar with Fibonacci series. It is a series of numbers in which each number is the sum of two preceding numbers.
0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , .....
The order is got like this ---
First we start with 0 and 1.
Next number is obtained by adding 0 and 1.
i.e. 0 + 1 = 1
1 + 1 = 2
2 + 1 = 3 etc
We can say that by adding the number with the previous number , we get the next number.
X n = X ( n-1 ) + X ( n-2 )
where X n = term number " n "
X ( n-1 ) = previous term of n , i.e. ( n-1 )
X ( n-2 ) = previous term of ( n-1 ) i.e. (n-2 )
0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , .....
The order is got like this ---
First we start with 0 and 1.
Next number is obtained by adding 0 and 1.
i.e. 0 + 1 = 1
1 + 1 = 2
2 + 1 = 3 etc
We can say that by adding the number with the previous number , we get the next number.
X n = X ( n-1 ) + X ( n-2 )
where X n = term number " n "
X ( n-1 ) = previous term of n , i.e. ( n-1 )
X ( n-2 ) = previous term of ( n-1 ) i.e. (n-2 )
