Nemotron-IMO-Bench 2026 C5 Let 0<a1<a2<…0<a_1<a_2<\ldots0<a1<a2<… be an increasing sequence of positive integers such that for any n>1n>1n>1 and any ε1,…,εn−1∈{0,1}\varepsilon_1,\ldots, \varepsilon_{n-1}\in \{0,1\}ε1,…,εn−1∈{0,1} an≠ε1a1+…+εn−1an−1.a_n\ne \varepsilon_1a_1+\ldots+\varepsilon_{n-1} a_{n-1}.an=ε1a1+…+εn−1an−1. Let NMN_MNM be the number of terms of the sequence (an)n≥1(a_n)_{n\geq 1}(an)n≥1 not exceeding MMM. Prove that for all M>kM>kM>k NM≤ak+Mk+1.N_M\leq a_k+\frac{M}{k+1}.NM≤ak+k+1M. 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. RO-TST 1996 Problem 2Putnam 1968 A2KöMaL 2018 A739SCHWEITZER 2000 Problem 5SCHWEITZER 1996 Problem 3 PreviousA5 NextG5 Locator nemotron-imo-bench/2026/c5 · Tag SHYW1GHPA4 · Edit this page on GitHub · Keys: j next, k previous