IMC 2007, Day 1, Problem 5
Let be a positive integer and be arbitrary integers. Suppose that a function satisfies whenever and are integers and . 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. Let us define a subset of the polynomial ring as follows:
If is constant then the definition of implies , so we can assume that has a complex zero . Again, by the definition of , the polynomial belongs to for every natural number ; hence divides . This shows that all the complex numbers
Transcribed from the official solutions, pages 2–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.