Precalculus (6th Edition) Blitzer

Published by Pearson
ISBN 10: 0-13446-914-3
ISBN 13: 978-0-13446-914-0

Chapter 10 - Section 10.4 - Mathematical Induction - Exercise Set - Page 1085: 32


See explanations.

Work Step by Step

Step 1. Checking for $n=1$, we have $0\lt x \lt 1$, which is true. Step 2. Assume the statement is true for $n=k$; we have $0\lt x^k \lt 1$ Step 3. For $n=k+1$, as $0\lt x\lt 1$, multiply $x$ to the above inequalities. We have $0\cdot x\lt x\cdot x^k\lt 1\cdot x$, which leads to $0\lt x^{k+1} \lt x \lt 1$. Thus, the statement is also true for $n=k+1$ Step 4. Thus, through mathematical induction, we proved that the statement is true for every positive integer 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.