olymmath

Nemotron-IMO-Bench 2026 N50

    A function f:N→Nf:\mathbf{N}\to \mathbf{N} has the property that gcd⁡(f(m),f(n))=1\gcd(f(m), f(n))=1 whenever gcd⁡(m,n)=1\gcd(m,n)=1, and n≤f(n)≤n+2012n\leq f(n)\leq n+2012 for all nn. Prove that if n>1n>1 then any prime divisor of f(n)f(n) is a prime divisor of 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/n50 · Tag 6CZ7GYMKDD · Edit this page on GitHub · Keys: j next, k previous