olymmath

Nemotron-IMO-Bench 2026 A29

    Let P∈Q[X]P\in \mathbb{Q}[X] be a nonconstant irreducible polynomial of degree nn. Prove that there are at most nn polynomials Q∈Q[X]Q\in \mathbb{Q}[X] of degree less than nn such that P(X)P(X) divides P(Q(X))P(Q(X)).

    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/a29 · Tag 3GG34BGXDV · Edit this page on GitHub · Keys: j next, k previous