IMC 2000, Day 2, Problem 3
Let be a polynomial of degree with complex coefficients. Prove that there exist at least complex numbers for which is or .
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. The statement is not true if is a constant polynomial. We prove it only in the case if is positive.
For an arbitrary polynomial and complex number , denote by the largest exponent for which is divisible by . (With other words, if is a root of , then is the root's multiplicity. Otherwise 0.)
Denote by and the sets of complex numbers for which is 0 or 1, respectively. These sets contain all roots of the polynomials and , thus
The polynomial has at most roots ( is used here). This implies that
If or , then
respectively. Putting (1), (2) and (3) together we obtain
Transcribed from the official solutions, pages 1–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.