Precalculus: Mathematics for Calculus, 7th Edition

Published by Brooks Cole
ISBN 10: 1305071751
ISBN 13: 978-1-30507-175-9

Chapter 12 - Section 12.5 - Mathematical Induction - 12.5 Exercises - Page 878: 21

Answer

See explanations.

Work Step by Step

Step 1. Prove the statement is true when $n=1$: $1\lt2^1$ , thus it is true for $n=1$. Step 2. Assume the statement is true when $n=k$: we have $k\lt 2^k$ or $k-2^k\lt 0$ Step 3. Prove it is true for $n=k+1$: $(k+1)-2^{k+1}=k+1-2^k-2^k=(k-2^k)+(1-2^k)$. As $k\geq1$, we have $2^k\gt1$ or $1-2^k\lt0$, we also have $k-2^k\lt 0$ and the sum of two negative numbers will also be negative, so that $(k+1)-2^{k+1}\lt0$ or $(k+1)\lt 2^{k+1}$ Thus, the statement is also true for $n=k+1$ Step 4. Conclusion: with mathematical induction, we have proved that the statement is true for all natural numbers $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.