Ask your own question, for FREE!
Mathematics 20 Online
OpenStudy (anonymous):

How would I prove Binet's Fibonacci Number formula not using induction or matrices? Please give me the complete proof. Thanks!

OpenStudy (dumbcow):

this one: \[f(n) = f(n-2) +f(n-1)\] f(0) = 0, f(1)=1

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!