Let a1,a2,…,a9 be a sequence of numbers satisfying 0<p≤ai≤q for each i=1,2,…,9. Prove that a9a1+a8a2+⋯+a1a9≤1+pq4(p2+q2).
Solution
Note that for any positive numbers a,b between p and q, we may assume (due to symmetry) that 0<p≤a≤b≤q. We have ba+ab≤qp+pq⟺aba2+b2≤pqp2+q2⟺p2ab+q2ab−a2pq−b2pq=(bq−ap)(aq−bp)≥0 Since the last inequality is true, the first is true as well. Thus LHS=(a9a1+a1a9)+⋯+(a6a4+a4a6)+a5a5≤1+pq4(p2+q2)
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.