SOLUTION: proof of
1+4+9+16+25+36+...+n^2=(n(n+1)(2*n+1))/6
plz answer me soon
Algebra.Com
Question 504679: proof of
1+4+9+16+25+36+...+n^2=(n(n+1)(2*n+1))/6
plz answer me soon
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
It is easy to prove via induction; but more difficult to derive the formula. To prove it by induction, note that the base case n = 1 holds. Assume it holds for n=k, e.g.
. Then we want to show it works for k+1:
which is what we would've gotten if we substituted k+1 into the formula. Hence the statement is true for all positive integers n.
RELATED QUESTIONS
2+4+6+.....2n=n(n+1) (answered by ikleyn)
Dear math teacher,
I am having difficulties with the following problem:
4 times nC2 (answered by Theo)
write sigma notation for the sequence... (answered by reviewermath)
n!(n+2)=n!+(n+1)!
(answered by LinnW)
nP4=84nC2 Solve for n using factorial notation
I'm really struggling with this... (answered by ikleyn)
simplify by removing factors of 1
n^2 - 16/(n+4)^2
n^2-16 over... (answered by jsmallt9)
Please find the limit of the following sequence as n goes to infinity:
{{{n/(n^2+1)... (answered by math_helper,robertb)
n(n+1)(n+2)is a multiple of 6.
(answered by MathLover1)
1. A(n)=-3+(n-1)(5)
2. A(n)=-11+(n-1)(2)
3. A(n)=9+(n-1)(8)
4. A(n)=0.5+(n-1)(3.5)
(answered by tommyt3rd)