Problem

Source: Chinese MO 2004

Tags: inequalities, algebra, polynomial, n-variable inequality



For a given positive integer $n\ge 2$, suppose positive integers $a_i$ where $1\le i\le n$ satisfy $a_1<a_2<\ldots <a_n$ and $\sum_{i=1}^n \frac{1}{a_i}\le 1$. Prove that, for any real number $x$, the following inequality holds \[\left(\sum_{i=1}^n\frac{1}{a_i^2+x^2}\right)^2\le\frac{1}{2}\cdot\frac{1}{a_1(a_1-1)+x^2} \] Li Shenghong