# Proof Help dealing Lucas and Fibonacci Numbers

Claim: $L_n=F_{n-1}+F_{n+1}$ for all $n >0$

Could someone please help me prove this. My professor mentioned it in class, but didn't show us how to prove it. I was just curious. The L stands for the Lucas Series and the F stands for the Fibonacci Numbers.

-
Have you tried anything? –  Ahaan S. Rungta Nov 23 '13 at 3:14
I don't even know where to start. –  A Glenn Nov 23 '13 at 3:17

The exact statement should be:

$$L_n=F_{n-1}+F_{n+1}$$

Prove it by Induction.

$P(1)$ and $P(2)$ are easy to check.

Then $P(n-1), P(n) \Rightarrow P(n+1)$ is easy:

$$L_{n+1}=L_n+L_{n-1}=F_{n-1}+F_{n+1}+F_{n-2}+F_{n}=\\(F_{n+1}+F_{n})+(F_{n-1}+F_{n-2})=F_{n+2}+F_n$$

-