olymmath

Nemotron-IMO-Bench 2026 N15

    Prove that there exists c>0c>0 such that for any odd prime p=2k+1p=2k+1, the numbers 10,21,32,…,kk−11^0, 2^1,3^2,\dots,k^{k-1} give at least cpc\sqrt{p} 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/n15 · Tag CNRMX1FVC1 · Edit this page on GitHub · Keys: j next, k previous