olymmath

ISL 1979 Problem 40

    A polynomial P(x)P(x) has degree at most 2k2k , where k=0,1,2,⋯k = 0, 1,2,\cdots . Given that for an integer ii , the inequality −k≤i≤k-k \le i \le k implies ∣P(i)∣≤1|P(i)| \le 1 , prove that for all real numbers xx , with −k≤x≤k-k \le x \le k , the following inequality holds: ∣P(x)∣<(2k+1)(2kk)|P(x)| < (2k + 1)\dbinom{2k}{k}

    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 isl/1979/p40 · Tag 1EVMZ6RJRC · Edit this page on GitHub · Keys: j next, k previous