View source for F(n+m+1)=F(n+1)F(m+1)+F(n)F(m)

==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 numbers|Fibonacci number]].

==Proof==

==References==
* {{PaperReference|A Primer on the Fibonacci Sequence Part I|1963|S.L. Basin|author2=V.E. Hoggatt, Jr.|prev=F(2n)=F(n)L(n)|next=Sum of squares of Fibonacci numbers}} (uses $p$ instead of $m$)

[[Category:Theorem]]
[[Category:Unproven]]