IMC 2010, Day 1, Problem 4
Let be two integers and suppose that is a positive integer for which the set
is finite. Prove that .
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
Solution. Assume that . Notice that may be replaced by any prime divisor of . Moreover, and should be coprime, otherwise the numbers not divisible by the greatest common divisor of cannot be represented as .
If , then the number of the form takes not all possible remainders modulo 8. If, say, is even, then takes at most three different remainders modulo 8, takes at most two, hence takes at most different remainders. If both and are odd, then ; the expression does not take the remainder 3 modulo 4 and does not take the remainder 2 modulo 4.
Consider the case when . The th powers take exactly different remainders modulo . Indeed, and have the same remainder modulo , and all numbers , , , are different even modulo . So, take at most different remainders modulo . If it takes strictly less then different remainders modulo , we get infinitely many non-representable numbers. If it takes exactly remainders, then is divisible by only if both and are divisible by . Hence if is divisible by , it is also divisible by . Again we get infinitely many non-representable numbers, for example the numbers congruent to modulo are non-representable.
Transcribed from the official solutions, page 3. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.