- #1
math_nerd
- 22
- 0
Given f1+f3+f5+...+f2n-1 = f2n.
Prove by induction.
So using the general Fibonacci sequence formula, Fn=Fn-1 + Fn-2 ,
I got f1+f3+...+f2n+1 = f2n+2
then using the formula, f1+f3+...+f2n+1 +f2n = f2n+2.
This ends up giving me, f2n + f2n does not equal f2n+2.
What's wrong here?
( I already proved the base case by the way).
Prove by induction.
So using the general Fibonacci sequence formula, Fn=Fn-1 + Fn-2 ,
I got f1+f3+...+f2n+1 = f2n+2
then using the formula, f1+f3+...+f2n+1 +f2n = f2n+2.
This ends up giving me, f2n + f2n does not equal f2n+2.
What's wrong here?
( I already proved the base case by the way).