IMC 2015, Day 2, Problem 10
Let be a positive integer, and let be a polynomial of degree with integer coefficients. 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
(Proposed by Géza Kós, Eötvös University, Budapest)
Solution. Let
For every positive integer , let
An equivalent form of the prime number theorem is that if . Therefore, for every and sufficiently large we have
Remark. The constant is not sharp. It is known that the best constant is between 0.4213 and 0.4232. (See I. E. Pritsker, The Gelfond–Schnirelman method in prime number theory, Canad. J. Math. 57 (2005), 1080–1101.)
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.