Use mathematical induction to prove the statement is true for all positive integers n.2n > 2n-1
What will be an ideal response?
Answers may vary. Possible answer:
First, we show the statement is true when n = 1.
For n = 1, 21 > 21-1.
Since 21-1 = 20 = 1 and 21 > 1, P1 is true and the first condition for the principle of induction is satisfied.
Next, we assume the statement holds for some unspecified natural number k. That is,
Pk: 2k > 2k-1 is assumed true.
On the basis of the assumption that Pk is true, we need to show that Pk+1 is true.
Pk+1: 2k+1 > 2k
So we assume that is true and multiply both sides of the equation by 2
2k? 2 > 2k-1? 2
2k+1 > 2(k-1)+1
2k+1 > 2k
So Pk+1 is true if Pk is assumed true. Therefore, by the principle of mathematical induction, for all natural numbers n.
You might also like to view...
Evaluate, if possible-
A. -3 B. Not a real number C. -9 D. -2
Find the dot product v ? w.v = i - j,
w = 7i + j
A. -7 -
B. 7 +
C. 7 -
D. -10
Solve the problem.Which of the following functions could have this graph?
A. y =
B. y =
C. y =
D. y =
Solve the problem.Find cos , given that cos ? = -
and ? terminates in 90° < ? < 180°.
A. -
B.
C.
D. -