Maths Olympiad Prep

Track / Stage 5 / 393 of 400 #993 of 1964

Problem 993

AIME late
Algebra Difficulty 6.0 Prove it

25. (USA) Let 0x11,i=1,2,0 \leqslant x_{1} \leqslant 1, i=1,2, \cdots, n,n>2n, n>2. Prove that there exists 1in11 \leqslant i \leqslant n-1 such that
x1(1x1+1)14x1(1xn). x_{1}\left(1-x_{1+1}\right) \geqslant \frac{1}{4} x_{1}\left(1-x_{n}\right) .

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

Let x1=a=max{x1,x2,,xn}x_{1}=a=\max \left\{x_{1}, x_{2}, \cdots, x_{n}\right\}, x1=b:xmin{x1,x2,,xn}x_{1}=b: x \min \left\{x_{1}, x_{2}, \cdots, x_{n}\right\}.

If x21+b2x_{2} \leqslant \frac{1+b}{2}, then x1(1x2)x1x_{1}\left(1-x_{2}\right) \geqslant x_{1}
- (11+b2)=12x1(1b)\left(1-\frac{1+b}{2}\right)=\frac{1}{2} x_{1}(1-b), obviously when i=1i=1

H(1) holds. If x2>1+b2x_{2}>\frac{1+b}{2}, since 1+b2a2\frac{1+b}{2} \geqslant \frac{a}{2}, and x1=b1+bx_{1}=b \leqslant-1+b, there are the following two cases:
(1) x1=b,x2>1+b2,x8>1+b2x_{1}=b, x_{2}>\frac{1+b}{2}, x_{8}>\frac{1+b}{2},
,x1>1+b2xm=min{x2,,x.}, \begin{aligned} \cdots, x_{1} & >\frac{1+b}{2} \\ x_{m} & =\min \left\{x_{2}, \cdots, x_{.}\right\}, \end{aligned}

where 2mn2 \leqslant m \leqslant n. It is easy to see that
xm1(1xm)>x1(1xn) x_{m-1}\left(1-x_{m}\right)>x_{1}\left(1-x_{n}\right) \text {. }
(2) There exists 3tn3 \leqslant t \leqslant n, such that xt=b1+b2x_{t}=b \leqslant \frac{1+b}{2}, then there exists 2in12 \leqslant i \leqslant n-1 such that x1>1+v2x_{1}>\frac{1+v}{2}, x1+11+b2x_{1+1} \leqslant \frac{1+b}{2}, so
x1(1x1+1)1+b2(11+b2)a4(1b)14x1(1x1). \begin{array}{l} x_{1}\left(1-x_{1+1}\right) \geqslant \frac{1+b}{2}\left(1-\frac{1+b}{2}\right) \\ \geqslant \frac{a}{4}(1-b) \geqslant \frac{1}{4} x_{1}\left(1-x_{1}\right) . \end{array}

In any case, (1) holds.

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