olymmath

Nemotron-IMO-Bench 2026 N28

    Is there a nonconstant polynomial f∈Z[X]f\in \mathbf{Z}[X] such that for all n>2n>2 the numbers f(0),f(1),...,f(n−1)f(0), f(1),..., f(n-1) give at most 0.499n0.499n different remainders when divided by nn?

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