Maths Olympiad Prep

Library / /329 of 520

Algebra Difficulty 7.0 National olympiad Prove it

Example 2.1.11 Let a,b,c>0a, b, c > 0, and satisfy the conditions abc,a+b+c=3a \leq b \leq c, a+b+c=3, prove that
3a2+1+5a2+3b2+1+7a2+5b2+3c2+19\sqrt{3 a^{2}+1}+\sqrt{5 a^{2}+3 b^{2}+1}+\sqrt{7 a^{2}+5 b^{2}+3 c^{2}+1} \leq 9
(Pham Kim Hung)

Solution

Proof: According to the Cauchy-Schwarz inequality, we have
(3a2+1+5a2+3b2+1+7a2+5b2+3c2+1)2=(166(3a2+1)+144(5a2+3b2+1)+133(7a2+5b2+3c2+1))2(16+14+12)(6(3a2+1)+4(5a2+3b2+1)+3(7a2+5b2+3c2+1))2\begin{array}{l} \left(\sqrt{3 a^{2}+1}+\sqrt{5 a^{2}+3 b^{2}+1}+\sqrt{7 a^{2}+5 b^{2}+3 c^{2}+1}\right)^{2} \\ =\left(\frac{1}{\sqrt{6}} \sqrt{6\left(3 a^{2}+1\right)}+\frac{1}{\sqrt{4}} \sqrt{4\left(5 a^{2}+3 b^{2}+1\right)}+\frac{1}{\sqrt{3}} \sqrt{3\left(7 a^{2}+5 b^{2}+3 c^{2}+1\right)}\right)^{2} \\ \leq\left(\frac{1}{6}+\frac{1}{4}+\frac{1}{2}\right)\left(6\left(3 a^{2}+1\right)+4\left(5 a^{2}+3 b^{2}+1\right)+3\left(7 a^{2}+5 b^{2}+3 c^{2}+1\right)\right)^{2} \end{array}

Thus, it suffices to prove
59a2+27b2+9c29559 a^{2}+27 b^{2}+9 c^{2} \geq 95

Noting that abca \leq b \leq c, we have
ab+bc+ca2ab+b22a2+b2a b+b c+c a \geq 2 a b+b^{2} \geq 2 a^{2}+b^{2}

or
5a2+3b2+c2(a+b+c)2=959a2+27b2+9c2955 a^{2}+3 b^{2}+c^{2} \leq(a+b+c)^{2}=9 \Rightarrow 59 a^{2}+27 b^{2}+9 c^{2} \leq 95

This is because a1a \leq 1. Equality holds if and only if a=b=ca=b=c.

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.