Maths Olympiad Prep

Library / /10 of 36

, 2023

Algebra Difficulty 8.0 Shortlist Prove it Baltic Way

Let nn be a positive integer and let a1,a2,,ana_1, a_2, \dots, a_n and b1,b2,,bnb_1, b_2, \dots, b_n be positive real numbers. Prove that
a1a1b1+a2a2b2++ananbn(a1+a2++an)a1+a2++anb1+b2++bn a_1 \sqrt{\frac{a_1}{b_1}} + a_2 \sqrt{\frac{a_2}{b_2}} + \dots + a_n \sqrt{\frac{a_n}{b_n}} \ge (a_1 + a_2 + \dots + a_n) \sqrt{\frac{a_1 + a_2 + \dots + a_n}{b_1 + b_2 + \dots + b_n}}

Solution

For a,bR>0a, b \in \mathbb{R}_{>0} we consider the function f:R0Rf: \mathbb{R}_{\ge 0} \to \mathbb{R} with f(x)=bx3axf(x) = b x^3 - a x for all xR0x \in \mathbb{R}_{\ge 0}.
For x0x \ge 0 we have b(xa3b)2(x+2a3b)0b(x - \sqrt{\frac{a}{3b}})^2 (x + 2\sqrt{\frac{a}{3b}}) \ge 0 which is equivalent to
f(x)=bx3ax2a3a3b=f(a3b)=min(f). f(x) = b x^3 - a x \geq -\frac{2a}{3}\sqrt{\frac{a}{3b}} = f\left(\sqrt{\frac{a}{3b}}\right) = \min(f).
For i{1,,n}i \in \{1, \dots, n\} consider the functions fi:R0Rf_i: \mathbb{R}_{\ge 0} \to \mathbb{R} with fi(x)=bix3aixf_i(x) = b_i x^3 - a_i x for all xR0x \in \mathbb{R}_{\ge 0}, and put f=f1+f2++fnf = f_1 + f_2 + \dots + f_n. Note that
f(x)=(b1+b2++bn)x3(a1+a2++an)x f(x) = (b_1 + b_2 + \dots + b_n)x^3 - (a_1 + a_2 + \dots + a_n)x
for all xR0x \in \mathbb{R}_{\ge 0}. It follows that
min(fi)=233aiaibi \min(f_i) = -\frac{2}{3\sqrt{3}} \cdot a_i \sqrt{\frac{a_i}{b_i}}
for all i{1,,n}i \in \{1, \dots, n\} and
min(f)=233(a1+a2++an)a1+a2++anb1+b2++bn. \min(f) = -\frac{2}{3\sqrt{3}} \cdot (a_1 + a_2 + \dots + a_n) \sqrt{\frac{a_1 + a_2 + \dots + a_n}{b_1 + b_2 + \dots + b_n}}.
The desired inequality follows from the inequality
min(f1)+min(f2)++min(fn)min(f1+f2++fn) \min(f_1) + \min(f_2) + \dots + \min(f_n) \le \min(f_1 + f_2 + \dots + f_n)

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.