Home Competitions BG-MO 1983 Problem 2
Let b 1 ≥ b 2 ≥ … ≥ b n b_1\ge b_2\ge\ldots\ge b_n b 1 ≥ b 2 ≥ … ≥ b n be nonnegative numbers, and ( a 1 , a 2 , … , a n ) (a_1,a_2,\ldots,a_n) ( a 1 , a 2 , … , a n ) be an arbitrary permutation of these numbers. Prove that for every t ≥ 0 t\ge0 t ≥ 0 , ( a 1 a 2 + t ) ( a 3 a 4 + t ) ⋯ ( a 2 n − 1 a 2 n + t ) ≤ ( b 1 b 2 + t ) ( b 3 b 4 + t ) ⋯ ( b 2 n − 1 b 2 n + t ) . (a_1a_2+t)(a_3a_4+t)\cdots(a_{2n-1}a_{2n}+t)\le(b_1b_2+t)(b_3b_4+t)\cdots(b_{2n-1}b_{2n}+t). ( a 1 a 2 + t ) ( a 3 a 4 + t ) ⋯ ( a 2 n − 1 a 2 n + t ) ≤ ( b 1 b 2 + t ) ( b 3 b 4 + t ) ⋯ ( b 2 n − 1 b 2 n + t ) .
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 bg-mo/1983/p2 · Tag EWCGFMCST8 · Edit this page on GitHub · Keys: j next, k previous