Precalculus: Concepts Through Functions, A Unit Circle Approach to Trigonometry (3rd Edition)

Published by Pearson
ISBN 10: 0-32193-104-1
ISBN 13: 978-0-32193-104-7

Chapter 11 - Sequences; Induction; the Binomial Theorem - Chapter Test - Page 860: 14

Answer

See below.

Work Step by Step

1. Test for $n=1$, we have $LHS=2$ and $RHS=2$, thus it is true for $n=1$. 2. Assume it is true for $n=k$, we have $(1+\frac{1}{1})(1+\frac{1}{2})(1+\frac{1}{3})...(1+\frac{1}{k})=k+1$ 3. For $n=k+1$, we have $LHS=(1+\frac{1}{1})(1+\frac{1}{2})(1+\frac{1}{3})...(1+\frac{1}{k})(1+\frac{1}{k+1})=(k+1)(1+\frac{1}{k+1})=k+1+1=k+2=RHS$ 4. The statement is true for any natural number $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.