Use mathematical induction to prove that the statement is true for every positive integer n.10 + 20 + 30 + . . . + 10n = 5n(n + 1)
What will be an ideal response?
S1: | 10 ![]() |

10 = 10 ?
Sk: 10 + 20 + 30 + . . . + 10k = 5k(k + 1)
Sk+1: 10 + 20 + 30 + . . . + 10(k + 1) = 5(k + 1)(k + 2)
We work with Sk. Because we assume that Sk is true, we add the next multiple of 10, namely
10(k+1), to both sides.
10 + 20 + 30 + . . . + 10k + 10(k + 1) = 5k(k + 1) + 10(k + 1)
10 + 20 + 30 + . . . + 10(k + 1) = (k + 1)(5k + 10)
10 + 20 + 30 + . . . + 10(k + 1) = 5(k + 1)(k + 2)
We have shown that if we assume that Sk is true, and we add (10(k+1) to both sides of Sk, then Sk+1 is also true. By the principle of mathematical induction, the statement Sn is true for every positive integer n.
Mathematics
You might also like to view...
Express the value of the inverse hyperbolic function in terms of natural logarithms.sinh-1
A. ln 2
B. ln (4)
C. ln
D. ln
Mathematics
Simplify.-90 - 70
A. -16 B. 2 C. 0 D. -2
Mathematics
Solve the quadratic equation by any method.x2 + x + 5 = 0
A.
B. -1, 0
C. 1, 0
D. No real solutions
Mathematics
Graph the line containing the point P and having slope m.P = (-4, -8); m = - 1
A.
B.
C.
D.
Mathematics