olymmath

KMO 2002 Problem 4

    For n≥3n \ge 3 , let S=a1+a2+⋯+anS=a_1+a_2+\cdots+a_n and T=b1b2⋯bnT=b_1b_2\cdots b_n for positive real numbers a1,a2,…,an,b1,b2,…,bna_1,a_2,\ldots,a_n, b_1,b_2 ,\ldots,b_n , where the numbers bib_i are pairwise distinct.

    (a) Find the number of distinct real zeroes of the polynomial f(x)=(x−b1)(x−b2)⋯(x−bn)∑j=1najx−bjf(x)=(x-b_1)(x-b_2)\cdots(x-b_n)\sum_{j=1}^n \frac{a_j}{x-b_j} (b) Prove the inequality 1n−1∑j=1n(1−ajS)bj>(TS∑j=1najbj)1n−1\frac1{n-1}\sum_{j=1}^n \left(1-\frac{a_j}{S}\right)b_j > \left(\frac{T}{S}\sum_{j=1}^{n} \frac{a_j}{b_j}\right)^{\frac1{n-1}}

    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/2002/p4 · Tag VDQEJYYX3W · Edit this page on GitHub · Keys: j next, k previous