olymmath

KMO 2016 Problem 6

    For a positive integer nn , there are nn positive reals a1≥a2≥a3⋯≥ana_1 \ge a_2 \ge a_3 \cdots \ge a_n . For all positive reals b1,b2,⋯bnb_1, b_2, \cdots b_n , prove the following inequality. a1b1+a2b2+⋯+anbna1+a2+⋯an≤max{b11,b1+b22,⋯ ,b1+b2+⋯+bnn}\frac{a_1b_1+a_2b_2 + \cdots +a_nb_n}{a_1+a_2+ \cdots a_n} \le \text{max}\{ \frac{b_1}{1}, \frac{b_1+b_2}{2}, \cdots, \frac{b_1+b_2+ \cdots +b_n}{n} \}

    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 kr-kmo/2016/p6 · Tag ARMS5RQ7EY · Edit this page on GitHub · Keys: j next, k previous