Use mathematical induction to prove that the statement is true for every positive integer n.4 + 8 + 12 + ... + 4n = 2n(n + 1)
What will be an ideal response?
Answers will vary. One possible proof follows.
a). If n = 1, then 4 = 2(1)(1 + 1) = 4. So, the statement is true for n = 1.
b). Assume that the statement is true for n = k:
4 + 8 + 12 + ... + 4k = 2k(k + 1).
Add 4(k + 1) to both sides to obtain:
4 + 8 + 12 + ... + 4k + 4(k + 1) = 2k(k + 1) + 4(k + 1)
Factor the right hand side to get:
4 + 8 + 12 + ... + 4k + 4(k + 1) = 2(k + 1)(k + 2)
The statement is true for n = k + 1 if it is true for n = k. Furthermore, the statement is true for n = 1. Therefore, the statement is true for all natural numbers n.
You might also like to view...
Use the figure below to answer the following question(s).
In which graph does each vertex have the same degree?
A. Graph 1 B. Graph 3 C. Graph 4 D. Graph 2 E. none of these
Solve the problem. Write ratios in lowest terms.Peter's farm has a well that is 7
feet deep. Jill has a well in her backyard which is 11 feet deep. Find the ratio of the depth of Peter's well to Jill's well.
A. 
B. 
C. 
D. 
Find the equation of the line that passes through the two given points. If possible, write your equation in slope-intercept form.(7, -34) and (7, -19)
A. y = 7 B. y = -7 C. x = 7 D. x = -7
Write a system of two linear equations in x and y whose graphs are given. Then, solve the system.Intercept point at (0, 0). Other points graphed are at (5, 7), (1, 9) and (6, -1).
What will be an ideal response?