Maths Olympiad Prep

Library / /252 of 377

Algebra Difficulty 5.3 AIME, harder Prove it United States

Problem:
Let a1a_{1}, a2a_{2}, and a3a_{3} be nonzero complex numbers with non-negative real and imaginary parts. Find the minimum possible value of
a1+a2+a3a1a2a33 \frac{\left|a_{1}+a_{2}+a_{3}\right|}{\sqrt[3]{\left|a_{1} a_{2} a_{3}\right|}}

Solution

Solution:
Answer: 323\sqrt{3} \sqrt[3]{2}

Write a1a_{1} in its polar form reiθr e^{i \theta} where 0θπ20 \leq \theta \leq \frac{\pi}{2}. Suppose a2,a3a_{2}, a_{3} and rr are fixed so that the denominator is constant. Write a2+a3a_{2}+a_{3} as seiϕs e^{i \phi}. Since a2a_{2} and a3a_{3} have non-negative real and imaginary parts, the angle ϕ\phi lies between 00 and π2\frac{\pi}{2}. Consider the function
f(θ)=a1+a2+a32=reiθ+seiϕ2=r2+2rscos(θϕ)+s2 f(\theta)=\left|a_{1}+a_{2}+a_{3}\right|^{2}=\left|r e^{i \theta}+s e^{i \phi}\right|^{2}=r^{2}+2 r s \cos (\theta-\phi)+s^{2}
Its second derivative is f(θ)=2rs(cos(θϕ))f''(\theta)=-2 r s (\cos (\theta-\phi)). Since π2(θϕ)π2-\frac{\pi}{2} \leq (\theta-\phi) \leq \frac{\pi}{2}, we know that f(θ)<0f''(\theta)<0 and ff is concave. Therefore, to minimize ff, the angle θ\theta must be either 00 or π2\frac{\pi}{2}. Similarly, each of a1,a2a_{1}, a_{2} and a3a_{3} must be either purely real or purely imaginary to minimize ff and the original fraction.

By the AM-GM inequality, if a1,a2a_{1}, a_{2} and a3a_{3} are all real or all imaginary, then the minimum value of the fraction is 33. Now suppose only two of the aia_{i}'s, say, a1a_{1} and a2a_{2} are real. Since the fraction is homogenous, we may fix a1+a2a_{1}+a_{2}—let the sum be 22. The term a1a2a_{1} a_{2} in the denominator achieves its maximum only when a1a_{1} and a2a_{2} are equal, i.e. when a1=a2=1a_{1}=a_{2}=1. Then, if a3=kia_{3}=k i for some real number kk, then the expression equals
k2+4k3 \frac{\sqrt{k^{2}+4}}{\sqrt[3]{k}}
Squaring and taking the derivative, we find that the minimum value of the fraction is 323\sqrt{3} \sqrt[3]{2}, attained when k=2k=\sqrt{2}. With similar reasoning, the case where only one of the aia_{i}'s is real yields the same minimum value.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.