Calculus (3rd Edition)

Published by W. H. Freeman
ISBN 10: 1464125260
ISBN 13: 978-1-46412-526-3

Appendix C - Induction and the Binomial Theorem - Exercises - Page A15: 8

Answer

$P(n)$ is true for all values of $n$.

Work Step by Step

We need to prove that $F_1^2+F_2^2+F_3^2+......F_n^2=F_{n+1}F_n$ 1. Our aim is to find that $P(n)$ is true for $n=1$ $F_1^2=F_{1+1}F_1 \implies 1 =1$ So, it is true for $n=1$. 2. Our aim is to find that $P(n)$ is true for $n=k$.This, it will also true for $n=k+1$ $(F_1^2+F_2^2+F_3^2+......F_k^2)+F_{k+1}^2=F_{(k+1)+1}F_{k+1} \implies (F_{k+1})(F_k+F_{k+1})=F_{k+2} F_{k+1}$ This yields: $ (F_{k+1})(F_{k+2})=F_{k+1} F_{k+2}$ So, it is true for $n=k+1$. Therefore, $P(n)$ is true for all values of $n$.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.