Sum of Fibonacci numbers

From specialfunctionswiki
Revision as of 02:21, 15 September 2016 by Tom (talk | contribs) (Created page with "==Theorem== The following formula holds: $$\displaystyle\sum_{k=1}^n F_k = F_{n+2}-1,$$ where $F_k$ denotes the Fibonacci sequence. ==Proof== ==References== Category:...")
(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 Fibonacci sequence.

Proof

References