Use mathematical induction to prove that the statement is true for every positive integer n.(72)n = 72n
What will be an ideal response?
Answers will vary. One possible proof follows.
a). Let n = 1. The left-hand side becomes (72)(1) = 491 = 49.
The right-hand side becomes 72(1) = 72 = 49. Thus, the statement is true for n = 1.
b). Assume the statement is true for n = k:
(72)k= 72k
Multiply both sides by 72:
72(72)k = 72k ? 72
Using the product rule for exponents and the distributive property,
(72)k + 1 = 72k + 2 = 72(k + 1)
The statement is true for n = k + 1 as long as it is true for n = k. furthermore, it is true for n = 1. Thus, the statement is true for all natural numbers n.
You might also like to view...
Solve the problem.Find the value for x in the cube. Use exact values. 3 ft
A. 3 ft
B. 9 ft
C. 3 ft
D. 3 ft
Divide using long division.
A. x + 9
B.
C. x + 8 -
D. x + 8 +
Using gates, design a circuit for the conditional statement.
?
?
?
(a)
?
(b)
?
(c)
?
A. a
B. b
C. c
Use trigonometric identities to solve each equation in the interval [0, 2?]4 sin2 x = 4 cos x + 1
A.
B.
C. ?
D.