What is the digit sum of 1 3 + 2 3 + 3 3 + . . . + 9 9 8 3 + 9 9 9 3 + 1 0 0 0 3 ?
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.
We will use here this identity:
1 3 + 2 3 + 3 3 + . . . . . . . . + n 3 = ( 2 n ( n + 1 ) ) 2 .For our problem we have
1 3 + 2 3 + 3 3 + . . . . . . . . + 1 0 0 0 3 = ( 2 1 0 0 0 ∗ 1 0 0 1 ) 2 = 2 5 0 5 0 0 2 5 0 0 0 0 , thus the digit sum is 2 + 5 + 5 + 2 + 5 = 1 9
why is the square?
I will give you the whole proof. First look at this pattern:
1 3 = 1
1 3 + 2 3 = ( 1 + 2 ) 2 = 9
1 3 + 2 3 + 3 3 = ( 1 + 2 + 3 ) 2 = 3 6
1 3 + 2 3 + 3 3 + 4 3 = ( 1 + 2 + 3 + 4 ) 2 = 1 0 0
1 3 + 2 3 + 4 3 + 5 3 = ( 1 + 2 + 3 + 4 + 5 ) 2 = 2 2 5 . Isn't math wonderful?Thus,from this we can conclude that the sum of the form:
1 3 + 2 3 + 3 3 + . . . . . . . + n 3 will always be a square and it will be the square of 1 + 2 + 3 + . . . . . . . + n = 2 n ( n + 1 ) .
Problem Loading...
Note Loading...
Set Loading...
This is an example of special series case where the series is in the form 1 3 + 2 3 + 3 + . . . + n 3 . For the sum, we have an identity as follows----
1 3 + 2 3 + 3 3 + . . . . . + ( n − 1 ) 3 + n 3 = ( 2 1 n ( n + 1 ) ) 2 . So, we have ----
1 3 + 2 3 + 3 3 + . . . . + 1 0 0 0 3
= ( 2 1 × 1 0 0 0 × 1 0 0 1 ) 2 = ( 5 0 0 5 0 0 ) 2 = ( 5 0 0 5 ) 2 × ( 1 0 0 ) 2 = 2 5 0 5 0 0 2 5 × 1 0 0 0 0 = 2 5 0 5 0 0 2 5 0 0 0 0
Now, digit sum = 2 + 5 + 0 + 5 + 0 + 0 + 2 + 5 + 0 + 0 + 0 + 0 = 1 9