Maths Olympiad Prep

Library / /6 of 18

Algebra Difficulty 5.5 AIME, harder Prove it Austria

Let aa, bb and cc be real numbers with 0a,b,c20 \le a, b, c \le 2. Prove that
(ab)(bc)(ac)2. (a - b)(b - c)(a - c) \le 2.
When does equality hold?

Solution

We order the variables by size:
For abca \ge b \ge c, all three factors are positive and we have (ab)(bc)(ac)0(a-b)(b-c)(a-c) \ge 0.
For bcab \ge c \ge a and cabc \ge a \ge b, two of the factors are negative and one factor is positive, so we have again (ab)(bc)(ac)0(a-b)(b-c)(a-c) \ge 0.
For all the other orderings of variables, we have either three negative factors or one negative and two positive factors. This implies (ab)(bc)(ac)0(a-b)(b-c)(a-c) \le 0, so the inequality holds for these cases and there is no case of equality.

Let us now consider abca \ge b \ge c.
With the AM-GM-inequality, we get
(ab)(bc)(ab+bc)24=(ac)24. (a - b)(b - c) \le \frac{(a - b + b - c)^2}{4} = \frac{(a - c)^2}{4}.
So we obtain
(ab)(bc)(ac)(ac)24(ac)=(ac)34234=2. (a - b)(b - c)(a - c) \le \frac{(a - c)^2}{4}(a - c) = \frac{(a - c)^3}{4} \le \frac{2^3}{4} = 2.
The two remaining cases of orderings can be treated analogously.

We see that equality holds for ac=2a-c=2 and ab=bca-b=b-c, which implies a=2a=2, b=1b=1 and c=0c=0. Taking into account the analogous cases, we see that equality holds exactly for the triples (2,1,0)(2, 1, 0), (1,0,2)(1, 0, 2) and (0,2,1)(0, 2, 1).

(Karl Czakler) □

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.