Could someone prove the rule that the sum of n squares is given by : [n(n + 1)(2n + 1)]/6
- print Print
- list Cite
Expert Answers
calendarEducator since 2010
write12,544 answers
starTop subjects are Math, Science, and Business
We have to prove the sum of the squares of the first n numbers is given by n(n+1)(n+2)/6
We know that (x+1)^3 = x^3 + 3x^2 + 3x + 1, now if we write the cubes of the numbers 1 to n+1, we get
1^3 = (0+1) ^3 = 0^3 + 3(0^2) + 3 (0) + 1
2^3 = (1+1) ^3 = 1^3 + 3(1^2) + 3 (1) + 1
3^3 = (2+1) ^3 = 2^3 + 3(2^2) + 3 (2) + 1
…
n^3 = (n-1+1) ^3 = (n-1) ^3 + 3(n-1) ^2 + 3(n-1) + 1
(n+1)^3 = n^3 + 3n^2 + 3n + 1
We see that for all the cubes above other than (n+1)^3 there are equal terms on the right hand side as well as the left hand side. So we cancel them and we are left with:
(n+1)^3 = 3*sum of squares from 1 to n + 3*(sum of numbers from 1 to n) + n + 1
Denote the sum of the squares which we are finding by S
=> n^3 + 3n^2 + 3n + 1 = 3*S + 3*[sum of numbers from 1 to n] + n+1
As we are trying to find the sum of the squares I assume the relation for the sum of the numbers from 1 to n is known, which is n*(n+1)/2
So n^3 + 3n^2 + 3n + 1 = 3*S + 3*n(n+1)/2 + n+1
=> n^3 + 3n^2 + 3n + 1 = 3*S + 3*(n^2 + n)/2 + n+1
=> 3*S = n^3 + 3n^2 + 3n + 1 - 3*(n^2 + n)/2 – n-1
=> 3*S = n^3 + 3n^2 + 3n + 1 – (3*n^2 -3n)/2 – n – 1
=> 3*S = n^3 + 3n^2/2 + n/2
=> S = (1/6)( 2n^3 + 3n^2 + n)
=> S = (1/6)*n*(2n^2 + 3n +1)
=> S = (1/6)*n*(2n^2 + 2n + n +1)
=> S = (1/6)*n*(2n(n+1)+1(n+1))
=> S = (1/6)*n*(n+1)(2n+1)
Therefore we prove that the sum of the squares of the numbers from 1 to n is given by (1/6)*n*(n+1)(2n+1)
Related Questions
- Prove the relation: 1² + 2² + 3² ... n² = 1/6 n(n+1)(2n+1)
- 1 Educator Answer
- Use mathematical induction to prove that 2+4+6+...+2n = n^2+n true for all natural numbers
- 1 Educator Answer
- How do I calculate : `lim [1*3*5*7....*(2n-1)]/ [2*4*6*8...*(2n)]` `n-gtoo`
- 1 Educator Answer
- Prove 1(1!) + 2(2!)+3(3!)+...+n(n!)=(n+1)!-1 by using mathematical induction
- 1 Educator Answer
- prove n(n^2)-1) is divisible by 6 for all n answer using induction pls
- 2 Educator Answers
Sorry, that was not [n(n + 1)(n + 2)]/6 but [n(n + 1)(2n + 1)]/6. I see the change has been made. Thanks.
Unlock This Answer Now
Start your 48-hour free trial to unlock this answer and thousands more. Enjoy eNotes ad-free and cancel anytime.
Student Answers