Maths Olympiad Prep

Library / /4 of 15

Algebra Difficulty 5.4 AIME, harder Prove it Bulgaria

Find all positive integers nn such that if a,b,c0a, b, c \ge 0 and a+b+c=3a+b+c=3, then abc(an+bn+cn)3abc(a^n + b^n + c^n) \le 3.

Solution

For a=2a=2, b=c=12b=c=\frac{1}{2} and n3n \ge 3 the inequality is not satisfied. On the other hand, for n=1n=1 it is equivalent to the AM-GM inequality. It remains to consider the case n=2n=2.
We shall prove that the inequality is true for n=2n=2.

First solution. Set x=bcx = bc. Then
abc(a2+b2+c2)=ax(a2+(b+c)22x). abc(a^2 + b^2 + c^2) = ax(a^2 + (b+c)^2 - 2x).
The function x(p2x)x(p-2x) is increasing for xp4x \le \frac{p}{4}. Since
bc(b+c)24a2+(b+c)24, bc \le \frac{(b+c)^2}{4} \le \frac{a^2 + (b+c)^2}{4},
it follows that if b+c=b+cb+c = b'+c' and bcbcbc \le b'c', then
abc(a2+b2+c2)abc(a2+b2+c2). abc(a^2 + b^2 + c^2) \le ab'c'(a^2 + b'^2 + c'^2).
Without loss of generality we can assume that b1cb \le 1 \le c. Set b=1,c=b+c1b' = 1, c' = b+c-1. Since b+c=b+cb+c = b'+c' and bcbc=(b1)(c1)0bc-b'c' = (b-1)(c-1) \le 0, the above implies that
abc(a2+b2+c2)a(2a)(a2+1+(2a)2). abc(a^2 + b^2 + c^2) \le a(2-a)(a^2 + 1 + (2-a)^2).
Set d=(a1)2d = (a-1)^2. Then
a(2a)(a2+1+(2a)2)=(1d)(3+2d)=3d2d23 a(2-a)(a^2+1+(2-a)^2) = (1-d)(3+2d) = 3-d-2d^2 \le 3
and the given inequality (for n=2n=2) follows.

Second solution. Let n=2n=2 and set ab+bc+ac=xab+bc+ac=x. Then we have a2+b2+c2=92xa^2+b^2+c^2=9-2x and 9abcx29abc \le x^2 (this follows from the inequality (ab+bc+ac)23abc(a+b+c)(ab+bc+ac)^2 \ge 3abc(a+b+c)). Hence we have to prove that (92x)x227(9-2x)x^2 \le 27, which is equivalent to the obvious (2x+3)(x3)20(2x+3)(x-3)^2 \ge 0.

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.