Sum of Fibonacci numbers

From specialfunctionswiki
Revision as of 02:23, 15 September 2016 by Tom (talk | contribs)
Jump to: navigation, search

Theorem

The following formula holds: $$\displaystyle\sum_{k=1}^n F_k = F_{n+2}-1,$$ where $F_k$ denotes a Fibonacci number.

Proof

References