Olympiad Maths Prep

Track / Stage 8 / 1 of 180 #1701 of 2000

Problem 1701

IMO Shortlist mid-range; USAMO P2/P5
Geometry Difficulty 8.0 Prove it

In a planar rectangular coordinate system, a sequence of points An{A_n} on the positive half of the y-axis and a sequence of points Bn{B_n} on the curve y=2xy=\sqrt{2x} (x0)(x\ge0) satisfy the condition OAn=OBn=1n|OA_n|=|OB_n|=\frac{1}{n}. The x-intercept of line AnBnA_nB_n is ana_n, and the x-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++bnbn1+bn+1bn<n2004\frac{b_2}{b_1}+\frac{b_3}{b_2}+\ldots +\frac{b_n}{b_{n-1}}+\frac{b_{n+1}}{b_n}<n-2004.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

Given the sequences of points An A_n on the positive half of the y-axis and Bn B_n on the curve y=2x y = \sqrt{2x} with the condition OAn=OBn=1n |OA_n| = |OB_n| = \frac{1}{n} , we need to prove two statements.

1. an>an+1>4 a_n > a_{n+1} > 4 for all nN n \in \mathbb{N} .
2. There exists n0N n_0 \in \mathbb{N} such that for any n>n0 n > n_0 , b2b1+b3b2++bn+1bn<n2004\frac{b_2}{b_1} + \frac{b_3}{b_2} + \ldots + \frac{b_{n+1}}{b_n} < n - 2004 .

### Part 1: Proving an>an+1>4 a_n > a_{n+1} > 4

1. **Determine Coordinates of An A_n and Bn B_n **:
- An=(0,1n) A_n = \left(0, \frac{1}{n}\right)
- Bn=(bn,2bn) B_n = (b_n, \sqrt{2b_n})
- Given OBn=1n |OB_n| = \frac{1}{n} , we have:
bn2+2bn=1n2    bn=1+1n21 b_n^2 + 2b_n = \frac{1}{n^2} \implies b_n = \sqrt{1 + \frac{1}{n^2}} - 1

2. **Find the x-intercept an a_n of the line AnBn A_nB_n **:
- The slope of the line AnBn A_nB_n is:
slope=2bn1nbn0=2bn1nbn \text{slope} = \frac{\sqrt{2b_n} - \frac{1}{n}}{b_n - 0} = \frac{\sqrt{2b_n} - \frac{1}{n}}{b_n}
- The equation of the line is:
y1n=(2bn1nbn)x y - \frac{1}{n} = \left(\frac{\sqrt{2b_n} - \frac{1}{n}}{b_n}\right)x
- Setting y=0 y = 0 to find the x-intercept an a_n :
01n=(2bn1nbn)an    1n=(2bn1nbn)an 0 - \frac{1}{n} = \left(\frac{\sqrt{2b_n} - \frac{1}{n}}{b_n}\right)a_n \implies -\frac{1}{n} = \left(\frac{\sqrt{2b_n} - \frac{1}{n}}{b_n}\right)a_n
an=bn2bn1n=bn(1+n2bn)12n2bn=1+n2bnn2bn a_n = \frac{b_n}{\sqrt{2b_n} - \frac{1}{n}} = \frac{b_n(1 + n\sqrt{2b_n})}{1 - 2n^2b_n} = \frac{1 + n\sqrt{2b_n}}{n^2b_n}

3. **Simplify an a_n **:
an=1n2bn+2n2bn=bn+2+2(bn+2) a_n = \frac{1}{n^2b_n} + \sqrt{\frac{2}{n^2b_n}} = b_n + 2 + \sqrt{2(b_n + 2)}

4. **Show an>an+1 a_n > a_{n+1} **:
- Since 1n2>1(n+1)2 \frac{1}{n^2} > \frac{1}{(n+1)^2} , we have bn>bn+1 b_n > b_{n+1} .
- Therefore:
an=bn+2+2(bn+2)>bn+1+2+2(bn+1+2)=an+1 a_n = b_n + 2 + \sqrt{2(b_n + 2)} > b_{n+1} + 2 + \sqrt{2(b_{n+1} + 2)} = a_{n+1}

5. **Show an>4 a_n > 4 **:
- Since bn>0 b_n > 0 for all nN n \in \mathbb{N} :
an=bn+2+2(bn+2)>4 a_n = b_n + 2 + \sqrt{2(b_n + 2)} > 4

### Part 2: Proving the Inequality for bn b_n

1. **Define cn c_n **:
cn=1bn+1bn c_n = 1 - \frac{b_{n+1}}{b_n}

2. **Simplify cn c_n **:
cn=11+1(n+1)211+1n21 c_n = 1 - \frac{\sqrt{1 + \frac{1}{(n+1)^2}} - 1}{\sqrt{1 + \frac{1}{n^2}} - 1}
cn=1+1n21+1(n+1)21+1n21 c_n = \frac{\sqrt{1 + \frac{1}{n^2}} - \sqrt{1 + \frac{1}{(n+1)^2}}}{\sqrt{1 + \frac{1}{n^2}} - 1}
cn=n2(1n21(n+1)2)1+1n2+11+1n2+1+1(n+1)2 c_n = n^2\left(\frac{1}{n^2} - \frac{1}{(n+1)^2}\right) \cdot \frac{\sqrt{1 + \frac{1}{n^2}} + 1}{\sqrt{1 + \frac{1}{n^2}} + \sqrt{1 + \frac{1}{(n+1)^2}}}
cn>2n+1(n+1)2(12+121n2+1) c_n > \frac{2n + 1}{(n + 1)^2}\left(\frac{1}{2} + \frac{1}{2\sqrt{\frac{1}{n^2} + 1}}\right)
cn>2n+12(n+1)2=2n+1(2n+1)(n+2)n>1n+2 c_n > \frac{2n + 1}{2(n + 1)^2} = \frac{2n + 1}{(2n + 1)(n + 2) - n} > \frac{1}{n + 2}

3. **Sum cn c_n **:
Sn=c1+c2++cn S_n = c_1 + c_2 + \dots + c_n
- Let n=2k2 n = 2^k - 2 for some positive integer k2 k \geq 2 :
Sn>13+14++12k1+12k S_n > \frac{1}{3} + \frac{1}{4} + \dots + \frac{1}{2^k - 1} + \frac{1}{2^k}
=(12+1+122)+(122+1+123)++(12k1+1+12k) = \left(\frac{1}{2 + 1} + \frac{1}{2^2}\right) + \left(\frac{1}{2^2 + 1} + \frac{1}{2^3}\right) + \dots + \left(\frac{1}{2^{k-1} + 1} + \frac{1}{2^k}\right)
>2122+22123++2k112k=k12 > 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}

4. **Set n0 n_0 **:
- If we set n0=240092 n_0 = 2^{4009} - 2 , then for all n>n0 n > n_0 :
(1b2b1)+(1b3b2)++(1bn+1bn)=Sn>Sn0>400912=2004 \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
b2b1+b3b2++bnbn1+bn+1bn<n2004 \frac{b_2}{b_1} + \frac{b_3}{b_2} + \dots + \frac{b_n}{b_{n-1}} + \frac{b_{n+1}}{b_n} < n - 2004

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.