olymmath

CMO 2021 Problem 2

  • Day 1

Let m>1m>1 be an integer. Find the smallest positive integer nn , such that for any integers a1,a2,…,an;b1,b2,…,bna_1,a_2,\ldots ,a_n; b_1,b_2,\ldots ,b_n there exists integers x1,x2,…,xnx_1,x_2,\ldots ,x_n satisfying the following two conditions:

i) There exists i∈{1,2,…,n}i\in \{1,2,\ldots ,n\} such that xix_i and mm are coprime

ii) ∑i=1naixi≡∑i=1nbixi≡0(modm)\sum^n_{i=1} a_ix_i \equiv \sum^n_{i=1} b_ix_i \equiv 0 \pmod m

Dataset text AI-MO AoPS. Quoted with source.

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 cn-mo/2021/p2 · Tag CA723BRDC7 · Edit this page on GitHub · Keys: j next, k previous