Difference between revisions of "L(n)=F(n+1)+F(n-1)"

From specialfunctionswiki
Jump to: navigation, search
(Created page with "==Theorem== The following formula holds: $$L(n)=F(n+1)+F(n-1),$$ where $L(n)$ denotes a Lucas number and $F(n)$ denotes a Fibonacci numbers|Fibonacci numbe...")
(No difference)

Revision as of 00:26, 25 May 2017

Theorem

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

Proof

References