This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let S n = 1 2 + 2 2 + 3 2 + ⋯ + n 2 , We can prove the claim that S n = 6 n ( n + 1 ) ( 2 n + 1 ) is true by induction .
First note that S n = 1 2 = 1 = 6 1 ( 2 ) ( 3 ) . Therefore, the claim is true for n = 1 . Now, assuming that the claim is true for n , then
S n + 1 = S n + ( n + 1 ) 2 = 6 n ( n + 1 ) ( 2 n + 1 ) + ( n + 1 ) 2 = 6 ( n + 1 ) ( 2 n 2 + n + 6 n + 6 ) = 6 ( n + 1 ) ( 2 n 2 + 7 n + 6 ) = 6 ( n + 1 ) ( n + 2 ) ( 2 n + 3 ) = 6 ( n + 1 ) ( ( n + 1 ) + 1 ) ( 2 ( n + 1 ) + 1 )
The claim is also true for n + 1 , therefore it is true for all n ≥ 1 .