Skip to main content
OlympiadHQ

Browse · MathNet

Print

China Mathematical Olympiad

China number theory

Problem

Find all nonempty sets of integers such that for all (not necessarily distinct) .
Solution
Call a set "good" if it satisfies the property as stated in the problem.

(1) If has only one element, is "good".

(2) Now we can assume that contains at least two elements. Let Then there is an integer , such that . Note that So we have proved that if then Continuing this procedure, we can deduce that Let , it is easy to verify that is "good".

(3) Now we have proved that . If , pick a number , then there exists an integer , such that . Since at least one of and is indivisible by 3, we know that at least one of is contained in . If , note that , by the definition of , we must have . If , note that by the definition of , we also have . In both cases, we have proved that there is a number of the form . This must be divisible by 3, hence So Continuing this procedure, we have , , which implies that . We claim that , since for any number , there is an element in such that . By the definition of , we must have .

So , and it is easy to verify that such is "good".

We conclude that there are three classes of "good" sets: (1) ; (2) ; (3) , here .
Final answer
All such sets are exactly the following, for some integers a and positive integer d: (1) the singleton {a}; (2) the set {a + k d where k ranges over all integers not divisible by three}; (3) the full arithmetic progression {a + k d where k ranges over all integers}.

Techniques

OtherIntegers