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.
This problem can be solved neatly by collapsing a telescoping sum.
The n t h term of the series is
1 + 2 + ⋯ + n 1 = 2 1 ( n ) ( n + 1 ) 1 = 2 ( n 1 − n + 1 1 )
and so the series equals
2 ∑ n = 1 n = 1 0 0 ( n 1 − n + 1 1 )
Notice that the second term in each summand cancels out the first term in the next summand, so that the sum collapses like a folding telescope to give
2 ( 1 1 − 1 0 1 1 ) = 1 . 9 8 0
Notice that if you extend the series to infinity it converges to 2, which gives the very nice result that 'The sum of the reciptocals of the triangular numbers is equal to two.'!