olymmath

Nemotron-IMO-Bench 2026 C4

    Let nn be a positive integer and let SnS_n (respectively TnT_n) be the set of all bijections (respectively all maps) from [n]:={1,…,n}[n]:=\{1,\ldots, n\} to [n][n]. For τ∈Tn\tau\in T_n let ord(τ){\rm ord}(\tau) be the number of distinct maps in the set {τ,τ∘τ,τ∘τ∘τ,…}\{\tau, \tau \circ \tau, \tau \circ \tau \circ \tau, \ldots\}, where o denotes composition. Prove that for sufficiently large nn g(n)=max⁡τ∈Tnord⁡(τ)<max⁡τ∈Snord⁡(τ)+n0.501.g(n)=\max _{\tau \in T_n} \operatorname{ord}(\tau)<\max _{\tau \in S_n} \operatorname{ord}(\tau)+n^{0.501}.

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