Use mathematical induction to prove that the statement is true for every positive integer n.If 0 < a < 1, then an < an-1.(Assume that a is a constant.)
What will be an ideal response?
Answers will vary. One possible proof follows.
a). Let n = 1. Then, a1 < a1-1 = 1, or a < 1, which is true by assumption. Thus, the statement is true for n = 1.
b). Assume the statement is true for n = k:
ak < ak-1
Multiply both sides by a:
a?ak < ak-1?a
Using the product rule for exponents:
ak+1 < ak = a(k+1) - 1
The statement is true for n = k + 1 as long as it is true for n = k. Futhermore, the statement is true for n = 1. Thus, the statement is true for all natural numbers n.
You might also like to view...
Solve by the elimination method.3x - 6y = -4-9x + 18y = -12
A. {(12, -24)} B. No solution C. Infinitely many solutions D. {(-12, 24)}
Express as a single logarithm.28 log7 + log7(28x6) - log7 28
A. log7 x13/4 B. log7 x10 C. log7 x10/7 D. log7 x11/6
Solve the problem.What is the y-intercept of y = cot x?
A. 1
B. 0
C.
D. none
Factor the trinomial by grouping, or state that the trinomial is prime.7x2 - 33x - 10
A. prime B. (7x - 5)(x + 2) C. (7x + 2)(x - 5) D. (7x - 2)(x + 5)