document.write( "Question 504679: proof of
\n" ); document.write( "1+4+9+16+25+36+...+n^2=(n(n+1)(2*n+1))/6
\n" ); document.write( "plz answer me soon
\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #339732 by richard1234(7193)\"\" \"About 
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.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( ". Then we want to show it works for k+1:\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "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.
\n" ); document.write( "
\n" );