Inspired by a BMO Question

Algebra Level 2

n = 1 1 T n \sum_{n=1}^\infty \frac 1{T_n}

Find the sum above, where T n T_n is the n n th triangular number.


The answer is 2.0000000.

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.

1 solution

Samuel Sturge
Nov 16, 2019

The formula for the triangle numbers is T n = n ( n + 1 ) 2 T_n = \frac{n(n + 1)}{2} and so n = 1 1 T n = 2 n = 1 1 n ( n + 1 ) \sum_{n=1}^{\infty} \frac{1}{T_n} = 2\sum_{n=1}^{\infty} \frac{1}{n(n + 1)} . Now using partial fractions: x ( n + 1 ) + y n = 1 x(n + 1) + yn = 1 Plugging in n = 0 n = 0 : x = 1 x = 1 Plugging in n = 1 n = -1 : y = 1 , y = 1 -y = 1, y = -1 Indeed, n + 1 n = 1 n + 1 - n = 1 . Going back to our original summation, 2 n = 1 1 n ( n + 1 ) = 2 ( 1 1 1 2 + 1 2 1 3 + 1 3 1 4 . . . ) 2\sum_{n = 1}^{\infty} \frac{1}{n(n + 1)} = 2(\frac{1}{1} - \frac{1}{2} + \frac{1}{2} - \frac{1}{3} + \frac{1}{3} - \frac{1}{4} ... ) From this telescoping series it is clear that 2 n = 1 k 1 n ( n + 1 ) = 2 2 1 n + 1 2\sum_{n = 1}^{k} \frac{1}{n(n + 1)} = 2 - 2\frac{1}{n + 1} . It is obvious that as n n tends to \infty , so does n + 1 n + 1 , and as n + 1 n + 1 tends to 1 n + 1 \infty \frac{1}{n + 1} tends to 0 0 . Hence 2 n = 1 1 n ( n + 1 ) 2\sum_{n=1}^{\infty} \frac{1}{n(n + 1)} = 2

1 pending report

Vote up reports you agree with

×

Problem Loading...

Note Loading...

Set Loading...