Difference between revisions of "Sum of Fibonacci numbers"
From specialfunctionswiki
(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:...") |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 2: | Line 2: | ||
The following formula holds: | The following formula holds: | ||
$$\displaystyle\sum_{k=1}^n F_k = F_{n+2}-1,$$ | $$\displaystyle\sum_{k=1}^n F_k = F_{n+2}-1,$$ | ||
| − | where $F_k$ denotes the [[Fibonacci | + | where $F_k$ denotes the $k$th [[Fibonacci numbers|Fibonacci number]]. |
==Proof== | ==Proof== | ||
==References== | ==References== | ||
| + | * {{PaperReference|A Primer on the Fibonacci Sequence Part I|1963|S.L. Basin|author2=V.E. Hoggatt, Jr.|prev=Lucas numbers|next=Sum of Lucas numbers}} | ||
[[Category:Theorem]] | [[Category:Theorem]] | ||
[[Category:Unproven]] | [[Category:Unproven]] | ||
Latest revision as of 00:15, 25 May 2017
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.
