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
Algebra ->
Finance
-> 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
Log On
Question 1036870: 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) = k(k + 6)
7 + 9 + 11 + ... + (2k + 5) + (2(k+1) + 5) = k(k + 6) + (2(k+1) + 5) Answer by ikleyn(52781) (Show Source):
You can put this solution on YOUR website! .
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?
1. 7 + 9 + 11 + ... + (2k + 5) + (2(k+1) + 5) = k(k + 6) + (k+1)((k+1) + 6)
2. 7 + 9 + 11 + ... + (2(k+1) + 5) = k(k + 6)
3. 7 + 9 + 11 + ... + (2k + 5) = k(k + 6)
4. 7 + 9 + 11 + ... + (2k + 5) + (2(k+1) + 5) = k(k + 6) + (2(k+1) + 5)
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#4.
---------------------------------------------------
P.S. The method of the math induction is one of perfect and most brilliant methods,
but doing exercises like this one can only disgust students from the method (and from the Math itself).
If you want to learn the method of the math induction, learn it from other sources.