<?xml version="1.0" encoding="ISO-8859-1" ?>
  <resource>
  <id>374</id>
  <path>/www/nrich/html/content/01/09/15plus2/</path>
  <resourceTypeID>1</resourceTypeID>
  <last_published>2011-02-01T00:00:01</last_published>
  <indexXML>&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;p&gt;Prove that the sum of the reciprocals of the first $n$ triangular numbers gets closer and closer to $2$ as $n$ grows.&lt;/p&gt;
&lt;p&gt;&lt;br&gt;&lt;/br&gt;
 &lt;/p&gt;&lt;/mdoxml&gt;</indexXML>
  <solutionXML>&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;

&lt;p&gt;This solution was sent by Etienne from Parramatta Highschool,
NSW Australia.&lt;/p&gt;
&lt;p&gt;The $r$th triangular is $r(r+1)/2$ and it's reciprocal is
$2/[r(r+1)]=2 \times [1/(r(r+1))]$&lt;/p&gt;
&lt;p&gt;Now $1/r(r+1) = 1/r - 1/(r+1)$. Take note of this, very useful
technique!&lt;/p&gt;
&lt;p&gt;\[\frac{1}{r} - \frac{1}{r+1} = \frac{(r+1)-r}{r(r+1)} =
\frac{1}{r(r+1)} \]&lt;/p&gt;
&lt;p&gt;The sum of the reciprocals of the first n triangular numbers&lt;/p&gt;
&lt;p&gt;\[\frac{2}{1 \times 2} + \frac{2}{2 \times 3} + \cdots +
\frac{2}{n(n+1)} \] \[ = 2 \{ \frac{1}{1 \times 2} + \frac{1}{2
\times 3} + \cdots + \frac{1}{n(n+1)} \} \] \[ = 2 \{ [\frac{1}{1}
- \frac{1}{2}] + [\frac{1}{2} - \frac{1}{3}] + \cdots +
[\frac{1}{n} - \frac{1}{(n+1)}] \} \]&lt;/p&gt;
&lt;p&gt;Surprise, you get terms that cancel out each other, ie $-1/2$
and $1/2$, $-1/3$ and $1/3$, $-1/n$ and $1/n$. This is called
'telescoping'.&lt;/p&gt;
&lt;p&gt;The sum thus equals \[ 2 \{ 1 - \frac{1}{(n+1)} \} \]&lt;/p&gt;
&lt;p&gt;When n is large, $1/(n+1)$ is very small, so the sum is
approximately $2$.&lt;/p&gt;
&lt;p&gt;When $n$ tends to infinity, $1/(n+1)$ tends to $0$, and it turns
out the infinite sum is exactly $2$.&lt;/p&gt;
&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</solutionXML>
  <noteXML/>
  <clueXML>&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;p&gt;The algebraic expression for $r$th triangular number is&lt;/p&gt;
&lt;p&gt;$$T_r = \frac{1}{2} r(r+1) $$&lt;/p&gt;
&lt;p&gt; &lt;/p&gt;
&lt;p&gt;The expression that you are trying to evaluate is $$\sum_{r=1}^{n} \frac{1}{T_r} = \frac{1}{T_1} + \frac{1}{T_2} + \frac{1}{T_3} + ... + \frac{1}{T_n} \cong 2 $$&lt;/p&gt;&lt;/mdoxml&gt;</clueXML>
  <canonXML/>
  <end_user_role>2</end_user_role>
  <difficulty>3</difficulty>
  <keystage1>0</keystage1>
  <keystage2>0</keystage2>
  <keystage3>0</keystage3>
  <keystage4>0</keystage4>
  <keystage4plus>1</keystage4plus>
  <title>Reciprocal Triangles</title>
  <description>Prove that the sum of the reciprocals of the first n triangular
numbers is approximately equal to 2 when n is large and tends to 2
as n tends to infinity.</description>
  <spec_group>Advanced Algebra
    <specifier>Summation of series</specifier>
  </spec_group>
  <spec_group>Pre-Calculus and Calculus
    <specifier>Limits</specifier>
  </spec_group>
  <spec_group>Numbers and the Number System
    <specifier>Triangle numbers</specifier>
  </spec_group>
</resource>