olymmath

Nemotron-IMO-Bench 2026 N16

    Let p2p2 be an odd prime. For i∈{0,1,..,p−1}i\in \{0,1,..,p-1\} call f=a0+a1X+...+anXn∈Z[X]f=a_0+a_1X+...+a_nX^n\in \mathbf{Z}[X] ii-remainder if ∑j>0,p−1∣jaj≡i(modp).\sum_{j>0, p-1\mid j} a_j\equiv i\pmod p. Prove that f,f2,...,fp−2f, f^2,..., f^{p-2} are 00-remainder and fp−1f^{p-1} is 11-remainder if and only if f(0),f(1),...,f(p−1)f(0), f(1),..., f(p-1) give pairwise distinct remainders modulo pp.

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