SOLUTION: Find the Fibonacci number when n=101, using recursive relation. Take F95 = 101 and F94 = 102.

Algebra ->  Pythagorean-theorem -> SOLUTION: Find the Fibonacci number when n=101, using recursive relation. Take F95 = 101 and F94 = 102.       Log On


   

Question 1188935: Find the Fibonacci number when n=101, using recursive relation. Take F95 = 101 and F94 = 102.
Answer by ikleyn(52806) About Me  (Show Source):
You can put this solution on YOUR website!
.

It is not the standard Fibonacci sequence: it is modified Fibonacci sequence with some different starting conditions.


But, in any case, the definition of this Fibonacci sequence of numbers is

    F%5Bn%2B2%5D = F%5Bn%5D + F%5Bn%2B1%5D.


So,  F%5B96%5D = F%5B94%5D + F%5B95%5D = 102 + 101 = 203;

     F%5B97%5D = F%5B95%5D + F%5B96%5D = 101 + 203 = 304,


and you can continue these recursive calculations in the same way,  ON YOUR OWN  as far as you want.