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.
n = 1 ∑ 2 n = 1 + 2 = 3 , and 3 3 = 2 7
n = 1 ∑ 7 n 3 × 2 7 = 2 7 n = 1 ∑ 7 n 3 = 2 7 ( 1 3 + 2 3 + 3 3 + 4 3 + 5 3 + 6 3 + 7 3 )
Now, we can just calculate this, but there is a shortcut that I really enjoy. Consider the image below:
Here we have one square with area 1 2 , two squares with area 2 2 , three with area 3 2 , four with area 4 2 , and so on. Or in other words, 1 ( 1 2 ) , 2 ( 2 2 ) , 3 ( 3 2 ) , 4 ( 4 2 ) , etc. This becomes 1 3 , 2 3 , 3 3 , 4 3 , etc. Every series of even sided squares has an overlap, but this overlap is cancelled out completely by the empty gap. Therefore, we can see that the sum of the cubes fits perfectly in a square every time; numerically, this looks like 1 3 + 2 3 + 3 3 + 4 3 = ( 1 + 2 + 3 + 4 ) 2 , and likewise, following this pattern, 1 3 + 2 3 + 3 3 + ⋯ + n 3 = ( 1 + 2 + 3 + ⋯ + n ) 2 . So ( 1 3 + 2 3 + 3 3 + 4 3 + 5 3 + 6 3 + 7 3 ) = ( 1 + 2 + 3 + 4 + 5 + 6 + 7 ) 2 = 2 8 2 = 7 8 4 . Then 7 8 4 ∗ 2 7 = 2 1 1 6 8 .