SOLUTION: Find the Fibonacci number when n= 10 (𝐹10), using recursive relation. Take 𝐹0=2 and 𝐹1 =5. Upload your solution.

Question 1188737: Find the Fibonacci number when n= 10 (𝐹10), using recursive relation. Take 𝐹0=2 and 𝐹1 =5. Upload your solution.
Answer by ikleyn(52780) (Show Source): You can put this solution on YOUR website!
.


Use the formula for the Fibonacci sequense

    F(n+2) = F(n) + F(n+1).


The second term is  F(2) = F(1) + F(0) = 5 + 2 = 7;


The third term is   F(3) = F(2) + F(1) = 7 + 5 = 12


and so on.


Continue these calculations until you will get the 10-th term.


This exercise is a good job for a student, who wants to develop his (or her) skills and knowledge.

Happy calculations (!)

RELATED QUESTIONS
Find the Fibonacci number when n=101, using recursive relation. Take F95 = 101 and F94 =... (answered by ikleyn)

I'm having trouble solving using the recursive formula. Here's the problem: "Find the... (answered by Edwin McCravy)

Please Help!!! I can figure out a) but not b). Can you please explain this to me? Thanks... (answered by Earlsdon)

Find the 1st 5 values of the recursive function, then find their 1st and 2nd differences, (answered by drk)

Determine the 34th and 44th Fibonacci number. (answered by greenestamps,Edwin McCravy)

Please I will Cashapp 10$ If anyone can solve it it's due today I really need help.... (answered by Boreal)

The first 10 Fibonacci numbers are 1, 1, 2, 3, 5, 8, 13, 21, 34, 55. If the ith... (answered by jim_thompson5910)

I am working with recursive functions. I do not understand the examples given in the... (answered by stanbon)

What is the 7th number of this Fibonacci-type sequence? 2, ___, ___, 10, ___,... (answered by ikleyn,robertb)