Maths Olympiad Prep

Library / /18 of 29

Algebra Difficulty 5.7 AIME, harder Prove it Croatia

Let aa, bb, cc be distinct positive integers and let kk be a positive integer such that
ab+bc+ca3k21. ab + bc + ca \ge 3k^2 - 1.
Prove that 13(a3+b3+c3)abc+3k\frac{1}{3}(a^3 + b^3 + c^3) \ge abc + 3k.

Solution

The desired inequality is equivalent to a3+b3+c33abc9ka^3 + b^3 + c^3 - 3abc \ge 9k. We have
a3+b3+c33abc=(a+b+c)(a2+b2+c2abbcca). a^3 + b^3 + c^3 - 3abc = (a + b + c)(a^2 + b^2 + c^2 - ab - bc - ca).
Integers ab|a-b|, bc|b-c| and ca|c-a| can not all be equal 11 so
a2+b2+c2abbcca=12((ab)2+(bc)2+(ca)2)12(12+12+22)=3. \begin{aligned} a^2 + b^2 + c^2 - ab - bc - ca &= \frac{1}{2}((a-b)^2 + (b-c)^2 + (c-a)^2) \\ &\ge \frac{1}{2}(1^2 + 1^2 + 2^2) = 3. \end{aligned}

It follows that a3+b3+c33abc3(a+b+c)a^3 + b^3 + c^3 - 3abc \ge 3(a + b + c). Since
(a+b+c)2=a2+b2+c2+2ab+2bc+2ac=(a2+b2+c2abbcac)+3(ab+bc+ac)3+3(3k21)=9k2 \begin{aligned} (a + b + c)^2 &= a^2 + b^2 + c^2 + 2ab + 2bc + 2ac \\ &= (a^2 + b^2 + c^2 - ab - bc - ac) + 3(ab + bc + ac) \\ &\ge 3 + 3(3k^2 - 1) = 9k^2 \end{aligned}
it follows that a+b+c3ka+b+c \ge 3k so a3+b3+c33abc9ka^3 + b^3 + c^3 - 3abc \ge 9k.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.