olymmath

Nemotron-IMO-Bench 2026 C15

    Are there two different sets A,BA,B, each consisting of at most 201122011^2 positive integers, such that for all x∈(0,1)x\in (0,1) ∣∑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 Nemotron-IMO-Bench. Open licence.

    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 nemotron-imo-bench/2026/c15 · Tag KY6PH9XVCZ · Edit this page on GitHub · Keys: j next, k previous