SOLUTION: I am trying to prove the following identity by induction (basic number theory course): 1^2 + 2^2 + ... + k^2 = (n*(n+1)*(2*n + 1))/6 So far I have that when n = 1, LHS = 1^2, R

SOLUTION: I am trying to prove the following identity by induction (basic number theory course): 1^2 + 2^2 + ... + k^2 = (n(n+1)(2*n + 1))/6 So far I have that when n = 1, LHS = 1^2, R

Question 7468: I am trying to prove the following identity by induction (basic number theory course):
1^2 + 2^2 + ... + k^2 = (n*(n+1)*(2*n + 1))/6
So far I have that when n = 1, LHS = 1^2, RHS = (1*2*3)/6 = 6/6 = 1
therefore the theory is true when n = 1
Assume it is true for some positive integer k
1^2 + 2^2 + ... + k^2 = (k*(k+1)*((2*k)+1))/6
then try to prove it is also true for k+1
1^2 + 2^2 + ... + k^2 + (k+1)^2 = ((k*(k+1)*((2*k)+1))/6) + (k+1)^2
I can rearrange this to give me (1/6*(k+1)* k*((2*k)+1)) + (k+1)^2
and I can factor (k+1)^2 to give me k^2 + 2k + 1 but I'm not sure I'm making any progress.
I found a solution that shows the next step is
(1/6*(k+1) * (k*((2*k)+1) + (6*(k+1)))
but I can't figure how to get there from where I am.
Any help would be greatly appreciated.
Answer by longjonsilver(2297) (Show Source): You can put this solution on YOUR website!
i think some of your working is wrong.

Anyway, what i would do is the following:

assuming that + then we have to prove that + , which is will be equivalent to

Is this OK?

Right... becomes
(2k^3+9k^2+13k+6)/6

Now I am looking for one of the factors to be (k+1), so divide this into the numerator...it divides exactly, as I would expect, to leave which then factorises to give, fully,

Right, nearly there.
The first term is fine.
The second term can be written as (k+1) + 1
the third term can be written as 2(k+1)+1... just make sure you are happy that this is equivalent to 2k+3.

so, we have proved that + gives a formula of the same form as that for + by adding on the next term, namely (k+1), therefore QED.

jon.

RELATED QUESTIONS
Prove by induction that 2^n>=n^2. I was stocked at the induction step when... (answered by richard1234)

Prove by induction that for all n that are positive natural numbers: (Signma n, i=1) i^3 (answered by richard1234)

Use mathematical induction to prove the following. N^3 < or = (N+1)^2 ; N> or =... (answered by ikleyn)

Prove by induction n*1 + (n-1)*2 + (n-2)*3 + ... + 3*(n-2) + 2*(n-1) + 1*n =... (answered by ikleyn)

Prove by mathematical induction: ∑_(i=1)^n (3^i= 3(3^n-1)/2) (answered by Edwin McCravy)

If f(x) = x/sqr(1+x^2), prove by mathematical induction for n>=2 that f(f(...(f (x))...)) (answered by Theo)

Use the principle of mathematical induction to prove the following identity. If n is... (answered by venugopalramana)

I'm having difficulty solving an exercise. The question is: Prove 3^n >=1+2*n.... (answered by richard1234)

*Proof by induction: Prove that for n >= 1 2^(n+2)>= 2n + 5 I've solved the p(1)... (answered by Edwin McCravy)