Difference between revisions of "F(n+m+1)=F(n+1)F(m+1)+F(n)F(m)"
From specialfunctionswiki
(Created page with "==Theorem== The following formula holds: $$F(n+m+1)=F(n+1)F(m+1)+F(n)F(m),$$ where $F(n)$ denotes a Fibonacci number. ==Proof== ==References== * {{Pape...") |
(No difference)
|
Latest revision as of 00:33, 25 May 2017
Theorem
The following formula holds: $$F(n+m+1)=F(n+1)F(m+1)+F(n)F(m),$$ where $F(n)$ denotes a Fibonacci number.
Proof
References
- S.L. Basin and V.E. Hoggatt, Jr.: A Primer on the Fibonacci Sequence Part I (1963)... (previous)... (next) (uses $p$ instead of $m$)
