Let n be the sum of the first 100 sequences of positive integers, ie. (1)+(1+2)+(1+2+3)+...+(1+2+3+4+...+99+100). Find the last 3 digits of n .
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.
directly put n=100 in the equation 1/6(n)(n+1)(n+2). This is the short method for such questions!
The sum of the first x integers is x(x+1)/2. This is also equivalent to ( 2 x + 1 ) . So our sum of sums is in fact equivalent to ( 2 2 ) + ( 2 3 ) + ... + ( 2 1 0 1 ) . The Hockey Stick Identity states that this sum is equal to ( 3 1 0 2 ) = 171700. So the last 3 digits are 700.
Problem Loading...
Note Loading...
Set Loading...
The question is equivalent to asking for the sum of the first n triangular numbers. You can prove by induction that the sum of the first n triangular numbers is:
6 n ( n + 1 ) ( n + 2 )
In this case, we have n = 100 and thus the solution is:
6 1 0 0 ( 1 0 0 + 1 ) ( 1 0 0 + 2 ) = 171700