Maths Olympiad Prep

Library / /65 of 100

Algebra Difficulty 5.2 AIME, harder Prove it China

Let SnS_n denote the sum of the first nn terms in a number sequence {an}\{a_n\}, satisfying
Sn+an=n1n(n+1),n=1,2, S_n + a_n = \frac{n-1}{n(n+1)}, \quad n = 1, 2, \dots
Then an=a_n = \underline{\hspace{2cm}}.

Solution

As
an+1=Sn+1Sn=n(n+1)(n+2)an+1n1n(n+1)+an, \begin{aligned} a_{n+1} &= S_{n+1} - S_n \\ &= \frac{n}{(n+1)(n+2)} - a_{n+1} - \frac{n-1}{n(n+1)} + a_n, \end{aligned}
we have
2an+1=n+22(n+1)(n+2)1n+1+1n(n+1)+an=2(n+1)(n+2)+an+1n(n+1). \begin{aligned} 2a_{n+1} &= \frac{n+2-2}{(n+1)(n+2)} - \frac{1}{n+1} + \frac{1}{n(n+1)} + a_n \\ &= \frac{-2}{(n+1)(n+2)} + a_n + \frac{1}{n(n+1)}. \end{aligned}
Therefore,
an+1+1(n+1)(n+2)=12(an+1n(n+1)). a_{n+1} + \frac{1}{(n+1)(n+2)} = \frac{1}{2} \left( a_n + \frac{1}{n(n+1)} \right).
Define bn=an+1n(n+1)b_n = a_n + \frac{1}{n(n+1)}. It is easy to see that bn=12n1b1b_n = \frac{1}{2^{n-1}}b_1, b1=a1+12b_1 = a_1 + \frac{1}{2}. On the other hand, from S1+a1=2a1=0S_1 + a_1 = 2a_1 = 0 we get a1=0a_1 = 0. So b1=12b_1 = \frac{1}{2}, bn=12nb_n = \frac{1}{2^n}. Therefore,
an=bn1n(n+1)=12n1n(n+1). a_n = b_n - \frac{1}{n(n+1)} = \frac{1}{2^n} - \frac{1}{n(n+1)}.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.