Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2000 / Problems / Day 2, P9

IMC 2000 · Day 2 · P9

easy

Let p(z)p(z) be a polynomial of degree nn with complex coefficients. Prove that there exist at least n+1n+1 complex numbers zz for which p(z)p(z) is 0 or 1.

Solution (official)

The statement is not true if pp is a constant polynomial. We prove it only in the case if nn is positive.

For an arbitrary polynomial q(z)q(z) and complex number cc, denote by μ(q,c)\mu(q, c) the largest exponent α\alpha for which q(z)q(z) is divisible by (zc)α(z - c)^\alpha. (With other words, if cc is a root of qq, then μ(q,c)\mu(q, c) is the root's multiplicity. Otherwise 0.)

Denote by S0S_0 and S1S_1 the sets of complex numbers zz for which p(z)p(z) is 0 or 1, respectively. These sets contain all roots of the polynomials p(z)p(z) and p(z)1p(z) - 1, thus cS0μ(p,c)=cS1μ(p1,c)=n.(1)\tag{1} \sum_{c \in S_0} \mu(p, c) = \sum_{c \in S_1} \mu(p - 1, c) = n. The polynomial pp' has at most n1n - 1 roots (n>0n > 0 is used here). This implies that cS0S1μ(p,c)n1.(2)\tag{2} \sum_{c \in S_0 \cup S_1} \mu(p', c) \le n - 1. If p(c)=0p(c) = 0 or p(c)1=0p(c) - 1 = 0, then μ(p,c)μ(p,c)=1orμ(p1,c)μ(p,c)=1,(3)\tag{3} \mu(p, c) - \mu(p', c) = 1 \quad \text{or} \quad \mu(p - 1, c) - \mu(p', c) = 1, respectively. Putting (1), (2) and (3) together we obtain S0+S1=cS0(μ(p,c)μ(p,c))+cS1(μ(p1,c)μ(p,c))==cS0μ(p,c)+cS1μ(p1,c)cS0S1μ(p,c)n+n(n1)=n+1.\begin{align*} |S_0| + |S_1| &= \sum_{c \in S_0} \bigl( \mu(p, c) - \mu(p', c) \bigr) + \sum_{c \in S_1} \bigl( \mu(p - 1, c) - \mu(p', c) \bigr) = \\ &= \sum_{c \in S_0} \mu(p, c) + \sum_{c \in S_1} \mu(p - 1, c) - \sum_{c \in S_0 \cup S_1} \mu(p', c) \ge n + n - (n - 1) = n + 1. \end{align*}

How the field did

contestants scored
114
average (of 20)
11.07
solved (≥ 80%)
52.6%
near-0 (≤ 10%)
32.5%
discrimination
0.65

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2007 · Day 1 · P6killeravg 0.6/10 · solved 3% · near-0 91% · disc 0.37
IMC 2017 · Day 1 · P5killeravg 0.2/10 · solved 2% · near-0 97% · disc 0.42
IMC 2009 · Day 1 · P4killeravg 0.1/10 · solved 0% · near-0 98% · disc 0.22