Find the smallest positive integer , such that for any selection of integers, there exist at least two numbers whose sum or difference is divisible by 1991.
(Australian Mathematics Competition, 1991)
Solution
[Solution] Take a set of 996 integers
Then for all .
\begin{array}{l}
a_{i}+a_{j} \leqslant 995+994=1989, \\
0996$, so there exist at least two different numbers $a_{i}, a_{j}$, such that $a_{i}=-a_{j}$, thus we have
1991 \mid\left(a_{i}+a_{j}\right) \text {. }
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.