Ask your own question, for FREE!
Mathematics 9 Online
OpenStudy (mary.rojas):

Can you help me find the recursive formula,please

OpenStudy (anonymous):

Do you have a particular question?

OpenStudy (mary.rojas):

1,1,2,3,5,8,13....

OpenStudy (inkyvoyd):

that is the fibonacci sequence :)

OpenStudy (inkyvoyd):

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

OpenStudy (mary.rojas):

The sequence of the umber of bees in each generation is known as the Fibonacci sequence. Write a recursive formula for the Fibonacci sequence. (Hint:The recursive formula involves 2 previous terms ) @INKYVOYD OMG HII ;D And yes...I know

OpenStudy (inkyvoyd):

just use a_1=1; a_2=1; \(\Huge a_{n}=a_{n-1}+a_{n-2}\)

OpenStudy (mary.rojas):

WOW thank you for that link!!! Never even heard of that until this assignment, so that really helped!

OpenStudy (inkyvoyd):

yeah, it's a very interesting mathematical series :)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!