Sum of Fibonacci numbers squared | Lecture 10 | Fibonacci Numbers and the Golden Ratio

preview_player
Показать описание
How to compute the sum over the first n Fibonacci numbers squared.

Рекомендации по теме
Комментарии
Автор

thank you sir, you've saved my homework

donovanz
Автор

You are requested to solve this?
F(0)=0, F(1)=1, F(2)=1.
F(n+1)= F(n) + F(n-1). Fibonacci sequence.
Solve for: sqroot(1+ F2 × sqroot(1+ F4 × sqroot(1+ F6 × sqroot(1+ F8 ....)))) = ?

anuragguptamr.i.i.t.
Автор

Can you show me how to prove this using induction?

candosmith