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.
The sum of the first n positive integers is T n = 2 n ( n + 1 ) Substitute n = 1 0 0 0 and T n = 5 0 0 × 1 0 0 1 = 5 0 0 5 0 0 .
The formula can be proven by induction quite easily, or with A.P. formula. There are also formulae for the sum of squares, cubes, fourth powers, and so forth, but they grow in complexity.
Alternatively, you could use a method Gauss is said to have used as a small child. 1 + 2 + 3 + . . . + 9 9 9 + 1 0 0 0 = ( 1 + 1 0 0 0 ) + ( 2 + 9 9 9 ) + . . . + ( 5 0 0 + 5 0 1 ) = 5 0 0 × 1 0 0 1