LinearRecursion SpecialSequence

Problem - 3198
The Fibonacci sequence $(F_n)$, $n\ge 0$ is defined by the recurrence relation $F_{n+2}=F_{n+1}+F_{n}$ with $F_0=0$ and $F_1=1$. Prove for any $m, n \in\mathbb{N}$, we have $$F_{m+n+1}=F_{m+1}{n+1}+F_mF_n$$ Deduce from here that $F_{2n+1}=F_{n+1}^2 +F_n^2$ for any $n\in\mathbb{N}$.

report an error