Problem #WSP-000115

Problems Algebra Sequences Fibonacci

Problem

Prove for any integers m,n0 that Fm+n=Fm1Fn+FmFn+1.
Corollary: if kn, then FkFn. This can be proven by induction if we write n=sk for a natural s, then Fk+(s1)k=Fk1F(s1)k+FkF(s1)k+1.