IMC / 2000 / Problems / Day 2, P9
IMC 2000 · Day 2 · P9
easyLet be a polynomial of degree with complex coefficients. Prove that there exist at least complex numbers for which is 0 or 1.
Solution (official)
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
How the field did
Score distribution (field cohort)
Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.