SOLUTION: Suppose in a proof of the summation formula 7 + 9 + 11 + ... + (2n + 5) = n(n + 6) by mathematical induction, you show the formula valid for n = 1 and assume that it is valid for n

Question 1035623: Suppose in a proof of the summation formula 7 + 9 + 11 + ... + (2n + 5) = n(n + 6) by mathematical induction, you show the formula valid for n = 1 and assume that it is valid for n = k. What is the next equation in the induction step of this proof?
7 + 9 + 11 + ... + (2k + 5) + (2(k + 1) + 5) = k(k + 6) + (k + 1)(k + 1 + 6)
7 + 9 + 11 + ... + (2(k + 1) + 5) = k(k + 6)
7 + 9 + 11 + ... + (2k + 5) + (2(k + 1) + 5) = k(k + 6) + (2(k + 1) + 5)
7 + 9 + 11 + ... + (2k + 5) = k(k + 6)
Answer by robertb(5830) (Show Source): You can put this solution on YOUR website!
7 + 9 + 11 + ... + (2k + 5) + (2(k + 1) + 5) = k(k + 6) + 2(k + 1) + 5
=
RELATED QUESTIONS
Suppose in a proof of the summation formula 7 + 9 + 11 + ... + (2n + 5) = n(n + 6) by... (answered by ikleyn)

Suppose in a proof of the summation formula 1 + 5 + 9 + ... + (4n - 3) = n(2n - 1) by... (answered by robertb)

use mathematical induction to prove the summation formula: {{{sum((4i-1),1=1,n)}}} =... (answered by Edwin McCravy)

Let P(n) be the statement that 3^1 + 3^2 + � � � 3^n = 3/2(3^n-1) for the positive... (answered by ikleyn)

use mathematical induction to prove the summation of  i=1... (answered by KMST)

please help me with this use the method of mathematical induction to prove the following (answered by math-vortex)

Prove the following using mathematical induction. Be sure to show the anchor as well as... (answered by math_helper)

Use the method of mathematical induction to establish the following 1.... (answered by ikleyn)

using the proof of induction to prove N (answered by ikleyn)