olymmath

Nemotron-IMO-Bench 2026 C6

    Let p1,…,psp_1,\ldots, p_s be pairwise distinct primes and let x1,…,xnx_1,\ldots, x_n be integers, with n≥max⁡pin\geq \max p_i. Let Pi=p1…pspiP_i=\frac{p_1\ldots p_s}{p_i} and let Pi′P'_i be an integer such that PiPi′≡1(modpi)P_iP'_i\equiv 1\pmod {p_i}. For 1≤j≤n1\leq j\leq n let M(j)M^{(j)} be the number of sums of jj numbers among x1,…,xnx_1,\ldots, x_n which are relatively prime to p1…psp_1\ldots p_s and let M=M(1)−M(2)+…+(−1)n−1M(n).M=M^{(1)}-M^{(2)}+\ldots+(-1)^{n-1}M^{(n)}. For 1≤i≤s1\leq i\leq s and 1≤j≤n1\leq j\leq n let Ni(j)N_i^{(j)} be the number of sums of jj numbers among x1,…,xnx_1,\ldots, x_n which are relatively prime to pip_i, but not to PiP_i and let Ni=Ni(1)−Ni(2)+…+(−1)n−1Ni(n).N_i=N_i^{(1)}-N_i^{(2)}+\ldots+(-1)^{n-1}N_i^{(n)}. Prove that p1…ps∣M+∑i=1nPiPi′Ni.p_1\ldots p_s\mid M+\sum_{i=1}^n P_i P_i'N_i.

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