olymmath

US-TST 2011 Problem 9

    Determine whether or not there exist two different sets A,BA,B , each consisting of at most 201122011^2 positive integers, such that every xx with 0<x<10 < x < 1 satisfies the following inequality: ∣∑a∈Axa−∑b∈Bxb∣<(1−x)2011.\left| \sum_{a \in A} x^a - \sum_{b \in B} x^b \right| < (1-x)^{2011}.

    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 us-tst/2011/p9 · Tag M7M10TJN3C · Edit this page on GitHub · Keys: j next, k previous