olymmath

ISL 2017 A5

An integer n⩾3n \geqslant 3 is given. We call an nn-tuple of real numbers (x1,x2,…,xn)\left(x_{1}, x_{2}, \ldots, x_{n}\right) Shiny if for each permutation y1,y2,…,yny_{1}, y_{2}, \ldots, y_{n} of these numbers we have ∑i=1n−1yiyi+1=y1y2+y2y3+y3y4+⋯+yn−1yn⩾−1\sum_{i=1}^{n-1} y_{i} y_{i+1}=y_{1} y_{2}+y_{2} y_{3}+y_{3} y_{4}+\cdots+y_{n-1} y_{n} \geqslant-1 Find the largest constant K=K(n)K=K(n) such that ∑1⩽i<j⩽nxixj⩾K\sum_{1 \leqslant i<j \leqslant n} x_{i} x_{j} \geqslant K holds for every Shiny nn-tuple (x1,x2,…,xn)\left(x_{1}, x_{2}, \ldots, x_{n}\right).

Dataset text NuminaMath olympiads. Quoted with source.

Official text: IMO 2017 Shortlist booklet, page 7.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2017/a5 · Tag ZMFJDCXVVA · Edit this page on GitHub · Keys: j next, k previous