benchmarks.wiki / Public workspace
OlympiadBench / 1810 / An integer n≥3 is given. We call an n-tuple of real numbers…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
question
An integer is given. We call an -tuple of real numbers Shiny if for each permutation of these numbers we have
Find the largest constant such that
holds for every Shiny -tuple .
Plain-text mathematical notation (without MathML)
An integer n≥3 is given. We call an n-tuple of real numbers (x₁,x₂,…,x_(n)) Shiny if for each permutation y₁,y₂,…,y_(n) of these numbers we have ∑_(i=1)^(n−1)y_(i)y_(i+1)=y₁y₂+y₂y₃+y₃y₄+⋯+y_(n−1)y_(n)≥−1 Find the largest constant K=K(n) such that ∑_(1≤i<j≤n)x_(i)x_(j)≥K holds for every Shiny n-tuple (x₁,x₂,…,x_(n)).
Original LaTeX notation
An integer $n \geqslant 3$ is given. We call an $n$-tuple of real numbers $\left(x_{1}, x_{2}, \ldots, x_{n}\right)$ Shiny if for each permutation $y_{1}, y_{2}, \ldots, y_{n}$ of these numbers we have
$$
\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)$ such that
$$
\sum_{1 \leqslant i<j \leqslant n} x_{i} x_{j} \geqslant K
$$
holds for every Shiny $n$-tuple $\left(x_{1}, x_{2}, \ldots, x_{n}\right)$.answer type
Expression
is multiple answer
false
language
English
question type
Open-ended
subject
Math
Discussion
No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
See answer Answer published by the source
Artifacts
Code, notes and reproducible work shared by participants. Files are served from a separate origin.
No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Source and history
initial import