IMC 2001, Day 1, Problem 4
Let be a positive integer. Let be a polynomial of degree each of whose coefficients is , or , and which is divisible by . Let be a prime such that . Prove that the complex th roots of unity are roots of the polynomial .
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. Let and . As is well-known, the polynomial is irreducible, thus all are roots of , or none of them.
Suppose that none of is a root of . Then is a rational integer, which is not 0 and
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.