Find the value of the sum of 100 first cubes:
1 3 + 2 3 + 3 3 + 4 3 + 5 3 + ⋯ + 1 0 0 3
Bonus: Could you generalize this for the first n cubes?
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.
A much better way to present the "bonus" part, is to use the ( n + 1 ) 4 − n 4 as intuition to explain how to do the telescoping series - sum , and then explaining that with f ( n ) = [ 2 n ( n + 1 ) ] 2 , we obtain f ( n ) − f ( n − 1 ) = n 3 .
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Sum of n, n², or n³
The general formula for the sum of the first cubes is [ 2 n ( n + 1 ) ] 2 so we would just have to substitute the valors on it: [ 2 1 0 0 ( 1 0 0 + 1 ) ] 2 = 2 5 5 0 2 5 0 0
Bonus: to generalise this I used the Telescopic Method. So, in telescopic method, you want to express n 3 like a subtraction. For example, if we use a couple of transformations in the expression ( n + 1 ) 4 − n 4 we would get what we want:
4 1 [ ( n + 1 ) 4 − n 4 − 6 n 2 − 4 n − 1 ] = n 3
Now if we substitute some valors in the expression we obtained:
4 1 [ 2 4 − 1 4 − 6 × 1 2 − 4 × 1 − 1 ] = 1 3 4 1 [ 3 4 − 2 4 − 6 × 2 2 − 4 × 2 − 1 ] = 2 3 4 1 [ 4 4 − 3 4 − 6 × 3 2 − 4 × 3 − 1 ] = 3 3 4 1 [ 5 4 − 4 4 − 6 × 4 2 − 4 × 4 − 1 ] = 4 3
We can observe that if we sum all that up, the first and second terms inside the brackets cancell each other, the only terms which wouldn't be cancelled would be ( n + 1 ) 4 and − 1 4 after that we have a 6 multiplying a sume of the first n squares, so we substitute the formula or deduce it with this method. Next, there is a 4 multiplying the sum of the first n numbers also known as "Gauss Sum". So we again substitute the formula or deduce it and at the end we have a − 1 which is being subtracted n times so we can write it as − n . So the final expression would look like:
4 1 [ ( n + 1 ) 4 − 1 4 − 6 × ( 6 n ( n + 1 ) ( 2 n + 1 ) ) − 4 × ( 2 n ( n + 1 ) ) − n ] = [ 2 n ( n + 1 ) ] 2
And that's how we can obtain the general "n" formula. It's pretty curious because it is the square of the Gauss Sum. The title of this problem is in memory of G. H. Hardy, father of divergent sums.