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.
First, let us see if this is true for n = 1 ,
4 1 2 ( 1 + 1 ) 2 = 4 1 ( 2 ) 2 = 4 1 ( 4 ) = 4 4 = 1 , 1 3 = 1 , so it is true for n = 1 ,
Now, assume it is true for n = r so that,
1 3 + 2 3 + 3 3 + ⋯ + r 3 = 4 r 2 ( r + 1 ) 2 ,
Then 1 3 + 2 3 + 3 3 + ⋯ + r 3 + ( r + 1 ) 3 = 4 r 2 ( r + 1 ) 2 + ( r + 1 ) 3 ,
That equals 4 r 2 ( r + 1 ) 2 + 4 ( r + 1 ) 3 = 4 ( r + 1 ) 2 [ r 2 + 4 ( r + 1 ) ] ,
Which equals 4 ( r + 1 ) 2 ( r 2 + 4 r + 4 ) = 4 ( r + 1 ) 2 ( r + 2 ) ( r + 2 ) ,
Finally that equals 4 ( r + 1 ) 2 ( r + 2 ) 2 = 4 ( r + 1 ) 2 ( r + 1 ) + 1 ) 2 .
If it is true for r and r + 1 , it is true for all positive integers. Q.E.D.