Olympiad Maths Prep

Library / /19 of 22

Algebra Difficulty 6.0 AIME, harder Prove it Ukraine

max{x1,x21}min{x21,1x}, \max\{|x|-1, x^2-1\} \leq \min\{x^2-1, 1-x\},
where max{a,b}={a,if abb,if a<b\max\{a,b\} = \begin{cases} a, & \text{if } a \ge b \\ b, & \text{if } a < b \end{cases}, and min{a,b}={b,if aba,if a<b\min\{a,b\} = \begin{cases} b, & \text{if } a \ge b \\ a, & \text{if } a < b \end{cases}.

Solution

It is clear that
max{x1,x21}x21min{x21,1x}, \max\{|x|-1, x^2-1\} \geq x^2-1 \geq \min\{x^2-1, 1-x\},
so the inequality from the problem condition can be satisfied only if
max{x1,x21}=x21=min{x21,1x}, \max\{|x|-1, x^2-1\} = x^2-1 = \min\{x^2-1, 1-x\},
and this, in turn, implies that
x1x211x. |x|-1 \leq x^2-1 \leq 1-|x|.
Therefore, 1xx11-|x| \geq |x|-1, which means that x1|x| \leq 1. Also we should have that xx2=xx|x| \leq |x|^2 = |x| \cdot |x|, and since we already know that x1|x| \leq 1, this can happen only if x=1|x|=1 or x=0|x|=0, so x=1,x=0x=1, x=0 or x=1x=-1.

It is also easy to solve this problem using graphs (fig. 35). Here the graph of the left-hand side is drawn with dash-and-dash line, and the graph of the right-hand side – with dash-and-dot line. They intersect exactly at the specified values of xx.

Looking for a route rather than 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.