Maths Olympiad Prep

Library / /1 of 20

Algebra Difficulty 5.4 AIME, harder Prove it China

Prove that
1<(k=1nkk2+1)lnn12,n=1,2, -1 < \left( \sum_{k=1}^{n} \frac{k}{k^2 + 1} \right) - \ln n \le \frac{1}{2}, \quad n = 1, 2, \dots

Solution

We first prove that
x1+x<ln(1+x)<x,x>0.1 \frac{x}{1+x} < \ln(1+x) < x, \quad x > 0. \qquad \textcircled{1}
Let
h(x)=xln(1+x),g(x)=ln(1+x)x1+x. h(x) = x - \ln(1+x), \\ g(x) = \ln(1+x) - \frac{x}{1+x}.
Then, for x>0x > 0,
h(x)=111+x>0,g(x)=11+x1(1+x)2=x(1+x)2>0. h'(x) = 1 - \frac{1}{1+x} > 0, \\ g'(x) = \frac{1}{1+x} - \frac{1}{(1+x)^2} = \frac{x}{(1+x)^2} > 0.
Therefore,
h(x)>h(0)=0,g(x)>g(0)=0. h(x) > h(0) = 0, \quad g(x) > g(0) = 0.
This completes the proof of the inequalities ①.

Now let x=1nx = \frac{1}{n} in ①. We have
1n+1<ln(1+1n)<1n.2 \frac{1}{n+1} < \ln\left(1+\frac{1}{n}\right) < \frac{1}{n}. \qquad \textcircled{2}
Let
xn=k=1nkk2+1lnn. x_n = \sum_{k=1}^{n} \frac{k}{k^2 + 1} - \ln n.
Then
xnxn1=nn2+1ln(1+1n+1)<nn2+11n=1n(n2+1)<0. \begin{aligned} x_n - x_{n-1} &= \frac{n}{n^2+1} - \ln\left(1 + \frac{1}{n+1}\right) \\ &< \frac{n}{n^2+1} - \frac{1}{n} \\ &= -\frac{1}{n(n^2+1)} < 0. \end{aligned}
Therefore, xn<xn1<<x1=12x_n < x_{n-1} < \cdots < x_1 = \frac{1}{2}.

Furthermore,
lnn=(lnnln(n1))+(ln(n1)ln(n2))++(ln2ln1)+ln1=k=1n1ln(1+1k). \begin{aligned} \ln n &= (\ln n - \ln(n-1)) + (\ln(n-1) - \ln(n-2)) \\ &\quad + \cdots + (\ln 2 - \ln 1) + \ln 1 \\ &= \sum_{k=1}^{n-1} \ln\left(1 + \frac{1}{k}\right). \end{aligned}
Consequently,
xn=k=1nkk2+1k=1n1ln(1+1k)=k=1n1(kk2+1ln(1+1k))+nn2+1>k=1n1(kk2+11k)=k=1n11(k2+1)k>k=1n11(k+1)k=1+1n>1. \begin{aligned} x_n &= \sum_{k=1}^{n} \frac{k}{k^2+1} - \sum_{k=1}^{n-1} \ln\left(1 + \frac{1}{k}\right) \\ &= \sum_{k=1}^{n-1} \left( \frac{k}{k^2+1} - \ln\left(1 + \frac{1}{k}\right) \right) + \frac{n}{n^2+1} \\ &> \sum_{k=1}^{n-1} \left( \frac{k}{k^2+1} - \frac{1}{k} \right) \\ &= - \sum_{k=1}^{n-1} \frac{1}{(k^2+1)k} \\ &> - \sum_{k=1}^{n-1} \frac{1}{(k+1)k} \\ &= -1 + \frac{1}{n} > -1. \end{aligned}
This completes the proof.

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.