Problem

Source: USOMO #6

Tags: inequalities, Hi



Let $n \ge 2$ be an integer. Let $x_1 \ge x_2 \ge ... \ge x_n$ and $y_1 \ge y_2 \ge ... \ge y_n$ be $2n$ real numbers such that $$0 = x_1 + x_2 + ... + x_n = y_1 + y_2 + ... + y_n $$$$\text{and} \hspace{2mm} 1 =x_1^2 + x_2^2 + ... + x_n^2 = y_1^2 + y_2^2 + ... + y_n^2.$$Prove that $$\sum_{i = 1}^n (x_iy_i - x_iy_{n + 1 - i}) \ge \frac{2}{\sqrt{n-1}}.$$Proposed by David Speyer and Kiran Kedlaya