A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 4 years ago
prove by induction that 1^2 + 2^2 + 3^2 ... + n^2 = n(n+1)(2n+1)/6
anonymous
 4 years ago
prove by induction that 1^2 + 2^2 + 3^2 ... + n^2 = n(n+1)(2n+1)/6

This Question is Closed

phi
 4 years ago
Best ResponseYou've already chosen the best response.1Base case: n=1 1^2 =? 1*(1+1)*(2*1+1)/6 the left hand side is 1 the right hand side is 1*2*3/6 = 6/6 = 1. so n=1 works. Now assume the formula works for numbers up to n. Does it work for n+1? start with 1^2 + .... n^2 + (n+1)^2 now we assumed the formula works for the numbers up to n, so rewrite this sum as n(n+1)(2n+1)/6 + (n+1)^2 n(n+1)(2n+1)/6 + 6(n+1)(n+1)/6 [n(2n+1) + 6n+6](n+1)/6 [ 2n*n + 7n + 6](n+1)/6 (n+2)(2n+3)(n+1)/6 rename n+1 as m to make the answer more obvious note: (2n+3)= (n+n+1+1+1)= (n+1)+(n+1)+1= m+m+1= 2m+1 (m+1)(2m+1)m/6 which is the original formula

phi
 4 years ago
Best ResponseYou've already chosen the best response.1yes, I only did that so we can compare to the original formula n(n+1)(2n+1)/6

phi
 4 years ago
Best ResponseYou've already chosen the best response.1Turing test wrote it out nicely in the equation editor in your other post
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.