Sum of Fibonacci numbers

From specialfunctionswiki
Revision as of 00:15, 25 May 2017 by Tom (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Theorem

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

Proof

References