Prove $f_{1} + f_{3} + f_{5} +...+f_{2n-1} = f_{2n}$?

96 Views Asked by At

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?