Maths Olympiad Prep

Library / /37 of 52

Algebra Difficulty 8.4 Shortlist Prove it Romania

Determine the least real number cc satisfying the condition k=1nxk2cn\sum_{k=1}^{n} x_{k}^{2} \le cn, for all positive integers nn and all real numbers x1,,xnx_1, \dots, x_n greater than or equal to 1-1 such that k=1nxk3=0\sum_{k=1}^{n} x_{k}^{3} = 0.

Solution

The required number is c=4/3c = 4/3. We first show that if nn is a positive integer and x1,,xnx_1, \dots, x_n are real numbers greater than or equal to 1-1 such that k=1nxk3=0\sum_{k=1}^{n} x_k^3 = 0, then k=1nxk24n/3\sum_{k=1}^{n} x_k^2 \le 4n/3. Indeed, since xk33xk2+4=(xk+1)(xk2)20x_k^3 - 3x_k^2 + 4 = (x_k + 1)(x_k - 2)^2 \ge 0, k=1,,nk = 1, \dots, n, it follows that k=1nxk24n/3+(1/3)k=1nxk3=4n/3\sum_{k=1}^{n} x_k^2 \le 4n/3 + (1/3) \sum_{k=1}^{n} x_k^3 = 4n/3.

The latter inequality is strict, unless nn is divisible by 99, in which case equality holds if and only if 8n/98n/9 numbers are 1-1 and the remaining n/9n/9 are all 22. The conclusion follows.

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.