So...Many...Sums

Level 2

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 .


The answer is 700.

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.

3 solutions

Frank Aiello
Aug 25, 2017

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:

n ( n + 1 ) ( n + 2 ) 6 \frac{n(n+1)(n+2)}{6}

In this case, we have n = 100 and thus the solution is:

100 ( 100 + 1 ) ( 100 + 2 ) 6 \frac{100(100+1)(100+2)}{6} = 171700

Prince Loomba
Nov 9, 2014

directly put n=100 in the equation 1/6(n)(n+1)(n+2). This is the short method for such questions!

Josh Rowley
Dec 27, 2013

The sum of the first x integers is x(x+1)/2. This is also equivalent to ( x + 1 2 ) \binom{x+1}{2} . So our sum of sums is in fact equivalent to ( 2 2 ) \binom{2}{2} + ( 3 2 ) \binom{3}{2} + ... + ( 101 2 ) \binom{101}{2} . The Hockey Stick Identity states that this sum is equal to ( 102 3 ) \binom{102}{3} = 171700. So the last 3 digits are 700.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...