Maths Olympiad Prep

Library / /498 of 520

Algebra Difficulty 7.7 National olympiad, round 2 Prove it

Example 6.17 (Vo Quoc Ba Can) a,b,ca, b, c are non-negative real numbers, and abc=1abc=1, prove that
a8+b3k+b8+c3k+c8+a3k3k2k\frac{a}{\sqrt[k]{8+b^{3}}}+\frac{b}{\sqrt[k]{8+c^{3}}}+\frac{c}{\sqrt[k]{8+a^{3}}} \geqslant \sqrt[k]{3^{k-2}}

for all k1,kRk \geqslant 1, k \in \mathbf{R}.

Solution

Prove that by the weighted AM-GM inequality we have
a3+8+9(k1)9k(8+a39)14a^{3}+8+9(k-1) \geqslant 9 k\left(\frac{8+a^{3}}{9}\right)^{\frac{1}{4}}

which is equivalent to
a3+9k19k8+a39n\frac{a^{3}+9 k-1}{9 k} \geqslant \sqrt[n]{\frac{8+a^{3}}{9}}

Similarly, we can get
b3+9k19k(8+b39)1kc3+9k19k(8+c39)1k\begin{array}{l} \frac{b^{3}+9 k-1}{9 k} \geqslant\left(\frac{8+b^{3}}{9}\right)^{\frac{1}{k}} \\ \frac{c^{3}+9 k-1}{9 k} \geqslant\left(\frac{8+c^{3}}{9}\right)^{\frac{1}{k}} \end{array}

Let 9k1=m9 k-1=m, then we only need to prove
ab3+m3m+1\sum \frac{a}{b^{3}+m} \geqslant \frac{3}{m+1}

where m0m \geqslant 0. By making the substitution a=xy,b=zx,c=yza=\frac{x}{y}, b=\frac{z}{x}, c=\frac{y}{z}, where x,y,z>0x, y, z>0, the inequality becomes
x4y(z3+kx3)3k+1\sum \frac{x^{4}}{y\left(z^{3}+k x^{3}\right)} \geqslant \frac{3}{k+1}

By the Cauchy-Schwarz inequality, we have
x4y(z3+kx3)(x2+y2+z2)2cycyz3+kyycx3y\sum \frac{x^{4}}{y\left(z^{3}+k x^{3}\right)} \geqslant \frac{\left(x^{2}+y^{2}+z^{2}\right)^{2}}{\sum_{c y c} y z^{3}+k \sum_{y y c} x^{3} y}

Vasile's inequality tells us that
cycyz313(x2+y2+z2)2cycx3y13(x2+y2+z2)2\begin{array}{l} \sum_{c y c} y z^{3} \leqslant \frac{1}{3}\left(x^{2}+y^{2}+z^{2}\right)^{2} \\ \sum_{c y c} x^{3} y \leqslant \frac{1}{3}\left(x^{2}+y^{2}+z^{2}\right)^{2} \end{array}

Thus, the proposition is proved.

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.