Sum of even indexed Fibonacci numbers
From specialfunctionswiki
Revision as of 02:25, 15 September 2016 by Tom (talk | contribs) (Created page with "==Theorem== The following formula holds: $$\displaystyle\sum_{k=1}^n F_{2k} = F_{2n+1}-1,$$ where $F_{2k}$ denotes a Fibonacci number. ==Proof== ==Ref...")
Theorem
The following formula holds: $$\displaystyle\sum_{k=1}^n F_{2k} = F_{2n+1}-1,$$ where $F_{2k}$ denotes a Fibonacci number.
