IMC 2007, Day 1, Problem 1
Let be a polynomial of degree with integer coefficients. Suppose that is divisible by for every integer . Prove that all coefficients of are divisible by .
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 1. Let . Substituting , and , we obtain that , and . Then and . Therefore 5 divides , and and the statement follows.
Solution 2. Consider as a polynomial over the 5-element field (i.e. modulo 5). The polynomial has 5 roots while its degree is at most 2. Therefore and all of its coefficients are divisible by 5.
Transcribed from the official solutions, page 1. 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.