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...
Graph the function. 
a. 
b. 
c. 
d. 
Provide an appropriate response.Find: 
f(x)
Fill in the blank(s) with the appropriate word(s).
Find the vertex, focus, directrix, and focal width of the parabola.x2 = 28y
A. Vertex: (0, 0); Focus: (7, 0); Directrix: x = 7; Focal width: 7 B. Vertex: (0, 0); Focus: (7, 0); Directrix: y = 7; Focal width: 112 C. Vertex: (0, 0); Focus: (0, -7); Directrix: x = -7; Focal width: 112 D. Vertex: (0, 0); Focus: (0, 7); Directrix: y = -7; Focal width: 28
Graph the linear function. Give the domain and range.f(x) = x + 1
A. Domain: (-?, ?); range: (-?, ?)
B. Domain: (-6, ?); range: (-?, 6)
C. Domain: (-?, ?); range: (-6, 6)
D. Domain: (-?, ?); range: (-?, ?)