Maths Olympiad Prep

Library / /333 of 520

Algebra Difficulty 5.5 AIME, harder Find the answer

3. Let f=uv(u,vR+)f=uv\left(u, v \in \mathbf{R}_{+}\right). It is known that for all positive triples (a,b,c)(a, b, c) satisfying a+b+c=1a+b+c=1, the inequality
u(ab+bc+ca)+vabc73 u(ab+bc+ca)+vabc \leqslant \frac{7}{3}

always holds. Then the maximum value of ff is . \qquad

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

3. 4414\frac{441}{4}.

Given a+b+c=1,a,b,cR+a+b+c=1, a, b, c \in \mathbf{R}_{+}, we have ab+bc+ca(a+b+c)23=13a b+b c+c a \leqslant \frac{(a+b+c)^{2}}{3}=\frac{1}{3}, and abc(a+b+c3)3=127a b c \leqslant\left(\frac{a+b+c}{3}\right)^{3}=\frac{1}{27}.
Thus, u(ab+bc+ca)+vabc13u+127vu(a b+b c+c a)+v a b c \leqslant \frac{1}{3} u+\frac{1}{27} v. Let 13u+127v73\frac{1}{3} u+\frac{1}{27} v \leqslant \frac{7}{3}, which means 9u+v639 u+v \leqslant 63. Then f=uv=19×9uv19(9u+v2)2f=u v=\frac{1}{9} \times 9 u v \leqslant \frac{1}{9}\left(\frac{9 u+v}{2}\right)^{2} 19(632)2=4414\leqslant \frac{1}{9}\left(\frac{63}{2}\right)^{2}=\frac{441}{4}.
The equality holds when 9u=v=6329 u=v=\frac{63}{2}, i.e., u=72,v=632u=\frac{7}{2}, v=\frac{63}{2}.

If there exist u,vR+,uv>4414u^{\prime}, v^{\prime} \in \mathbf{R}_{+}, u^{\prime} v^{\prime}>\frac{441}{4}, such that for all positive numbers a,b,ca, b, c satisfying a+b+c=1a+b+c=1, the inequality
u(ab+bc+ca)+vabc73 u^{\prime}(a b+b c+c a)+v^{\prime} a b c \leqslant \frac{7}{3}
always holds. Taking a=b=c=13a=b=c=\frac{1}{3}, we get 13u+127v73\frac{1}{3} u^{\prime}+\frac{1}{27} v^{\prime} \leqslant \frac{7}{3}, which means 9u+v639 u^{\prime}+v^{\prime} \leqslant 63.
However, 9u+v29uv>29×4414=639 u^{\prime}+v^{\prime} \geqslant 2 \sqrt{9 u^{\prime} v^{\prime}}>2 \sqrt{9 \times \frac{441}{4}}=63, a contradiction.
Therefore, fmax =4414f_{\text {max }}=\frac{441}{4}.

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.