Maths Olympiad Prep

Library / /240 of 520

Algebra Difficulty 6.5 National olympiad Prove it

Example 9.5 (1980 USA Mathematical Olympiad) Let 0a,b,c10 \leqslant a, b, c \leqslant 1, prove that
ab+c+1+bc+a+1+ca+b+1+(1a)(1b)(1c)1\frac{a}{b+c+1}+\frac{b}{c+a+1}+\frac{c}{a+b+1}+(1-a)(1-b)(1-c) \leqslant 1

Solution

Prove that due to the symmetry of the inequality about a,b,ca, b, c, without loss of generality, assume 0abc10 \leqslant a \leqslant b \leqslant c \leqslant 1, then
 LHS =ab+c+1+(1a)(1b)(1c)a+b+ca+b+1+(1a)(1b)(1c)=11ca+b+1[1(1+a+b)(1a)(1b)]\begin{aligned} \text { LHS }= & \sum \frac{a}{b+c+1}+(1-a)(1-b)(1-c) \leqslant \\ & \frac{a+b+c}{a+b+1}+(1-a)(1-b)(1-c)= \\ & 1-\frac{1-c}{a+b+1}[1-(1+a+b)(1-a)(1-b)] \end{aligned}

It suffices to prove
1ca+b+1[1(1+a+b)(1a)(1b)]0\frac{1-c}{a+b+1}[1-(1+a+b)(1-a)(1-b)] \geqslant 0

In fact
(1+a+b)(1a)(1b)(1+a+b+ab)(1a)(1b)=(1a2)(1b2)1\begin{aligned} (1+a+b)(1-a)(1-b) \leqslant & (1+a+b+ab)(1-a)(1-b)= \\ & \left(1-a^{2}\right)\left(1-b^{2}\right) \leqslant 1 \end{aligned}

Thus, the original inequality holds.
Equality holds if and only if a=b=c=1a=b=c=1 or a=1,b=c=0a=1, b=c=0 and their cyclic permutations.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.