olymmath

VN-TST 1991 Problem 2

  • Day 1

For a positive integer n>2n>2 , let (a1,a2,…,an)\left(a_{1}, a_{2}, \ldots, a_{n}\right) be a sequence of nn positive reals which is either non-decreasing (this means, we have a1≤a2≤…≤ana_{1}\leq a_{2}\leq \ldots \leq a_{n} ) or non-increasing (this means, we have a1≥a2≥…≥ana_{1}\geq a_{2}\geq \ldots \geq a_{n} ), and which satisfies a1≠ana_{1}\neq a_{n} . Let xx and yy be positive reals satisfying xy≥a1−a2a1−an\frac{x}{y}\geq \frac{a_{1}-a_{2}}{a_{1}-a_{n}} . Show that: a1a2⋅x+a3⋅y+a2a3⋅x+a4⋅y+…+an−1an⋅x+a1⋅y+ana1⋅x+a2⋅y≥nx+y.\frac{a_{1}}{a_{2}\cdot x+a_{3}\cdot y}+\frac{a_{2}}{a_{3}\cdot x+a_{4}\cdot y}+\ldots+\frac{a_{n-1}}{a_{n}\cdot x+a_{1}\cdot y}+\frac{a_{n}}{a_{1}\cdot x+a_{2}\cdot y}\geq \frac{n}{x+y}.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

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

Locator vn-tst/1991/p2 · Tag QT3WT02T9G · Edit this page on GitHub · Keys: j next, k previous