Let n be a positive integer and let a1,a2,…,an and b1,b2,…,bn be positive real numbers. Prove that a1b1a1+a2b2a2+⋯+anbnan≥(a1+a2+⋯+an)b1+b2+⋯+bna1+a2+⋯+an
Solution
For a,b∈R>0 we consider the function f:R≥0→R with f(x)=bx3−ax for all x∈R≥0. For x≥0 we have b(x−3ba)2(x+23ba)≥0 which is equivalent to f(x)=bx3−ax≥−32a3ba=f(3ba)=min(f). For i∈{1,…,n} consider the functions fi:R≥0→R with fi(x)=bix3−aix for all x∈R≥0, and put f=f1+f2+⋯+fn. Note that f(x)=(b1+b2+⋯+bn)x3−(a1+a2+⋯+an)x for all x∈R≥0. It follows that min(fi)=−332⋅aibiai for all i∈{1,…,n} and min(f)=−332⋅(a1+a2+⋯+an)b1+b2+⋯+bna1+a2+⋯+an. The desired inequality follows from the inequality min(f1)+min(f2)+⋯+min(fn)≤min(f1+f2+⋯+fn)
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.