IMC 2008, Day 1, Problem 3
Let be a polynomial with integer coefficients and let be integers.
a) Prove that there exists such that divides for all .
b) Does there exist an such that the product divides ?
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. The theorem is obvious if for some , so assume that all are nonzero and pairwise different.
There exist numbers , such that , , and .
As , are relatively prime numbers, there exist such that . Obviously and , so .
Similarly one obtains such that and thus also and .
Reasoning inductively we obtain the existence of as required.
The polynomial shows that the second part of the problem is not true, as , but no value of is divisible by for integer .
Remark. One can assume that the are nonzero and ask for such that is a nonzero multiple of all . In the solution above, it can happen that . But every number is also divisible by every , since the polynomial is nonzero, there exists such that satisfies the modified thesis.
Transcribed from the official solutions, page 2. 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.