olymmath

Nemotron-IMO-Bench 2026 C39

    Let p>3p>3 be a prime and color each of the numbers 1,2,…,p−11,2,\ldots, p-1 in red, blue or green. Assume that all three colors are used. Prove that there are three numbers x,y,zx,y,z with pairwise distinct colors such that x+y≡z(modp)x+y\equiv z\pmod p.

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