Maths Olympiad Prep

Track / Stage 5 / 25 of 400 #625 of 1964

Problem 625

AIME late
Algebra Difficulty 5.0 Prove it European Girls' Mathematical Olympiad · Romania · 2016

Let nn be an odd positive integer, and let x1,x2,,xnx_1, x_2, \dots, x_n be non-negative real numbers. Show that mink=1,,n(xk2+xk+12)maxk=1,,n(2xkxk+1)\min_{k=1,\dots,n} (x_k^2 + x_{k+1}^2) \le \max_{k=1,\dots,n} (2x_k x_{k+1}), where xn+1=x1x_{n+1} = x_1.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

In what follows, indices are reduced modulo nn. Consider the nn differences xk+1xkx_{k+1} - x_k, k=1,,nk = 1, \dots, n. Since nn is odd, there exists an index jj such that (xj+1xj)(xj+2xj+1)0(x_{j+1} - x_j)(x_{j+2} - x_{j+1}) \ge 0. Without loss of generality, we may and will assume both factors non-negative, so xjxj+1xj+2x_j \le x_{j+1} \le x_{j+2}. Consequently,
mink=1,,n(xk2+xk+12)xj2+xj+122xj+122xj+1xj+2maxk=1,,n(2xkxk+1). \min_{k=1,\dots,n} (x_k^2 + x_{k+1}^2) \le x_j^2 + x_{j+1}^2 \le 2x_{j+1}^2 \le 2x_{j+1}x_{j+2} \le \max_{k=1,\dots,n} (2x_k x_{k+1}).

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.