Can anyone prove the following equation?
($F_n$ is the $n$th element of Fibonacci series and $n \in N$.)
$\phi = 1 \times \phi + 0$
$\phi^2 = 1 \times \phi + 1 $
$\phi^3 = 2 \times \phi + 1 $
$\phi^4 = 3 \times \phi + 2 $
$\phi^5 = 5 \times \phi + 3 $
$\phi^6 = 8 \times \phi + 5 $
...
$\phi^n = F_n \times \phi + F_{n-1} $
(However for $ \phi ^ 1 $ , $F_{1-1}=F_0$ is not defined.)
You can easily prove that by induction: if $\phi^n=F_{n-1}+\phi F_n$, then $$ \phi^{n+1}=\phi^n\phi=(F_{n-1}+\phi F_n)\phi=\phi F_{n-1}+\phi^2 F_n=\phi F_{n-1}+(1+\phi) F_n=F_n+\phi(F_{n-1}+F_n)=F_n+\phi F_{n+1}. $$