Maths Olympiad Prep

Library / /13 of 13

Geometry Difficulty 7.0 National olympiad, round 2 Prove it China

In a planar rectangular coordinate system, a sequence of points {An}\{A_n\} on the positive half of the yy-axis and a sequence of points {Bn}\{B_n\} on the curve y=2xy = \sqrt{2x} (x0x \ge 0) satisfy the condition OAn=OBn=1n|OA_n| = |OB_n| = \frac{1}{n}. The xx-intercept of line segment AnBnA_nB_n is ana_n, and the xx-coordinate of point BnB_n is bnb_n, nNn \in \mathbb{N}. Prove that

(1) an>an+1>4a_n > a_{n+1} > 4, nNn \in \mathbb{N};

(2) There is n0Nn_0 \in \mathbb{N}, such that for any n>n0n > n_0, b2b1+b3b2++bn0bn01+bn+1bn<n2004\frac{b_2}{b_1} + \frac{b_3}{b_2} + \cdots + \frac{b_{n_0}}{b_{n_0-1}} + \frac{b_{n+1}}{b_n} < n - 2004.

Solution

(1) According to the stated conditions we have An(0,1n)A_n(0, \frac{1}{n}), and Bn(bn,2bn)B_n(b_n, \sqrt{2b_n}) (bn>0b_n > 0). From OBn=1n|OB_n| = \frac{1}{n} we get
bn2+2bn=(1n)2. b_n^2 + 2b_n = \left(\frac{1}{n}\right)^2.
Thus,
bn=(1n)2+11,nN. b_n = \sqrt{\left(\frac{1}{n}\right)^2 + 1} - 1, \quad n \in \mathbb{N}.

Since 2n2bn=1n2bn2>02n^2b_n = 1 - n^2b_n^2 > 0, we have bn+2=1n2bnb_n + 2 = \frac{1}{n^2b_n} and
an=bn(1+n2bn)12n2bn=bn(1+n2bn)1(1n2bn2)=1n2bn+2n2bn=bn+2+2(bn+2). \begin{aligned} a_n &= \frac{b_n(1 + n\sqrt{2b_n})}{1 - 2n^2b_n} = \frac{b_n(1 + n\sqrt{2b_n})}{1 - (1 - n^2b_n^2)} \\ &= \frac{1}{n^2b_n} + \frac{\sqrt{2}}{\sqrt{n^2b_n}} = b_n + 2 + \sqrt{2(b_n + 2)}. \end{aligned}
Thus,
an=(1n)2+1+1+2(1n)2+1+2. a_n = \sqrt{\left(\frac{1}{n}\right)^2 + 1} + 1 + \sqrt{2\sqrt{\left(\frac{1}{n}\right)^2 + 1} + 2}.
Since 1n>1n+1>0\frac{1}{n} > \frac{1}{n+1} > 0, an>an+1>4a_n > a_{n+1} > 4 for any nNn \in \mathbb{N}.

(2) Let cn=1bn+1bnc_n = 1 - \frac{b_{n+1}}{b_n} for nNn \in \mathbb{N}, then
cn=(1n)2+1(1n+1)2+1(1n)2+11=n2[1n21(n+1)2](1n)2+1+1(1n)2+1+(1n+1)2+1>2n+1(n+1)2[12+12(1n)2+1]>2n+12(n+1)2. \begin{align*} c_n &= \frac{\sqrt{\left(\frac{1}{n}\right)^2 + 1} - \sqrt{\left(\frac{1}{n+1}\right)^2 + 1}}{\sqrt{\left(\frac{1}{n}\right)^2 + 1} - 1} \\ &= n^2 \left[ \frac{1}{n^2} - \frac{1}{(n+1)^2} \right] \cdot \frac{\sqrt{\left(\frac{1}{n}\right)^2 + 1} + 1}{\sqrt{\left(\frac{1}{n}\right)^2 + 1} + \sqrt{\left(\frac{1}{n+1}\right)^2 + 1}} \\ &> \frac{2n+1}{(n+1)^2} \left[ \frac{1}{2} + \frac{1}{2\sqrt{\left(\frac{1}{n}\right)^2 + 1}} \right] > \frac{2n+1}{2(n+1)^2}. \end{align*}
Since (2n+1)(n+2)2(n+1)2=n>0(2n+1)(n+2) - 2(n+1)^2 = n > 0, we obtain
cn>1n+2,nN. c_n > \frac{1}{n+2}, \quad n \in \mathbb{N}.
Let Sn=c1+c2++cn,nNS_n = c_1 + c_2 + \dots + c_n, \quad n \in \mathbb{N}. If n=2k2>1n = 2^k - 2 > 1 (kNk \in \mathbb{N}), then
Sn>13+14++12k1+12k=(13+14)+[122+1++123]++[12k1+1++12k]>2122+22123++2k112k=k12. \begin{align*} S_n &> \frac{1}{3} + \frac{1}{4} + \dots + \frac{1}{2^k - 1} + \frac{1}{2^k} \\ &= \left(\frac{1}{3} + \frac{1}{4}\right) + \left[\frac{1}{2^2 + 1} + \dots + \frac{1}{2^3}\right] + \dots + \left[\frac{1}{2^{k-1} + 1} + \dots + \frac{1}{2^k}\right] \\ &> 2 \cdot \frac{1}{2^2} + 2^2 \cdot \frac{1}{2^3} + \dots + 2^{k-1} \cdot \frac{1}{2^k} = \frac{k-1}{2}. \end{align*}
Therefore, if we put n0=240092n_0 = 2^{4009} - 2, then for any n>n0n > n_0 we have
[1b2b1]+[1b3b2]++[1bn+1bn]=Sn>Sn0>400912=2004. \begin{aligned} \left[1 - \frac{b_2}{b_1}\right] + \left[1 - \frac{b_3}{b_2}\right] + \dots + \left[1 - \frac{b_{n+1}}{b_n}\right] &= S_n > S_{n_0} > \frac{4009 - 1}{2} \\ &= 2004. \end{aligned}
Consequently,

\frac{b_2}{b_1} + \frac{b_3}{b_2} + \cdots + \frac{b_n}{b_{n-1}} + \frac{b_{n+1}}{b_n} < n - 2004, \quad n > n_0.

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.