Prove formula for sum of Fibonacci sequence numbers by mathematical induction.
We need to prove the following using proof by induction. I don't want the actual answer if you can avoid it, I just can't figure out how to do it because when I do it how my notes read I am supposed to it doesn't work.
Anyway, this is what we were given on the paper;
Knowing that: Fn+1 = Fn + Fn-1 where F1 = 1 and F2 = 1 , prove the following by mathematical induction:
Σ Fi2 = Fn × Fn+1 n≥1