SOLUTION: For a proof by induction of the math statement below, identify the correct step for proving the theorem is true for n = k + 1.
3^2+6^2+9^2+...
Algebra.Com
Question 1035810: For a proof by induction of the math statement below, identify the correct step for proving the theorem is true for n = k + 1.
3^2+6^2+9^2+...
Answer by JoelSchwartz(130) (Show Source): You can put this solution on YOUR website!
The formula for this sequence 3^2+6^2+9^2+... is (3n)^2 when n starts at one.
When I substitute k+1 for n i get (3(k+1))^2 or (3k+3)^2 when k starts at zero for the first number of the sequence.
RELATED QUESTIONS
For a proof by induction of the math statement below, identify the correct step for... (answered by stanbon)
Identify the correct base case for a proof by induction for the following statement.... (answered by richard1234)
I was asked to do a proof by math induction for the formula of diagnols in a polygon.... (answered by stanbon)
I'm having difficulty solving an exercise.
The question is:
Prove 3^n >=1+2*n.... (answered by richard1234)
Use mathematical induction to prove that the statement is true for every positive integer (answered by stanbon,Edwin McCravy)
10. Which of the following statements is not correct?
A. Mathematical induction involves (answered by ikleyn)
*Proof by induction:
Prove that for n >= 1
2^(n+2)>= 2n + 5
I've solved the p(1)... (answered by Edwin McCravy)
Suppose in a proof of the summation formula 7 + 9 + 11 + ... + (2n + 5) = n(n + 6) by... (answered by robertb)
Suppose in a proof of the summation formula 7 + 9 + 11 + ... + (2n + 5) = n(n + 6) by... (answered by ikleyn)