olymmath

BG-MO 1983 Problem 2

    Let b1≥b2≥…≥bnb_1\ge b_2\ge\ldots\ge b_n be nonnegative numbers, and (a1,a2,…,an)(a_1,a_2,\ldots,a_n) be an arbitrary permutation of these numbers. Prove that for every t≥0t\ge0 , (a1a2+t)(a3a4+t)⋯(a2n−1a2n+t)≤(b1b2+t)(b3b4+t)⋯(b2n−1b2n+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).

    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