IMC 2010, Day 2, Problem 5
Suppose that for a function and real numbers one has for all . Prove that for all if
for every prime number and every real number .
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 be some integer to be defined later, and consider set of real polynomials
By the problem's conditions, for every prime divisors of we have . Since is a principal ideal domain (due to the Euclidean algorithm), the greatest common divisor of these polynomials is an element of . The complex roots of the polynomial are those th roots of unity whose order does not divide . The roots of the greatest common divisor is the intersection of such sets; it can be seen that the intersection consist of the primitive th roots of unity. Therefore,
Now choose in such a way that . It is well-known that , so there exists such a value for . Let where and . Then, by the definition of , we have for all .
If , then
Transcribed from the official solutions, page 4. 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.