Prove $f_{1} + f_{3} + f_{5} +...+f_{2n-1} = f_{2n}$ when $f_{n}$ is the $n$-th Fibonacci number.
Before I try to prove this, I am trying to understand this in English. What is happening in this equation? How can $2n-1 = 2n$? What is the English interpretation of this?
suppose it is true for n F1 + F3 + F5 + ... + F2n-1 = F2n
let's prove it for (n + 1) F1 + F3 + F5 + ... + F2n-1 + F2n+1 = F2n+2 (F1 + F3 + F5 + ... + F2n-1) + F2n+1 = F2n+2 F2n + F2n+1 = F2n+2
How does he deduce that f1 = f2? How does F2n-1 + F2n+1 = F2n+2?
– Dre_Dre Aug 12 '16 at 02:54