F(2n)=F(n+1)^2-F(n-1)^2

From specialfunctionswiki
Jump to: navigation, search

Theorem

The following formula holds: $$F(2n)=F(n+1)^2-F(n-1)^2,$$ where $F(n)$ denotes a Fibonacci number.

Proof

References