Let k and n be positive integers with n≥k2−3k+4, and
let
f(z)=zn−1+cn−2zn−2+⋯+c0
be a polynomial with complex coefficients such that
c0cn−2=c1cn−3=⋯=cn−2c0=0.
Prove that f(z) and zn−1 have at most n−k common roots.
(Proposed by Vsevolod Lev and Fedor Petrov,
St. Petersburg State University)
Solution (official)
Let M={z:zn=1},
A={z∈M:f(z)=0} and
A−1={z−1:z∈A}. We have to prove ∣A∣≥k.
Claim.
A⋅A−1=M.
That is, for any η∈M, there exist some elements
a,b∈A such that ab−1=η.
Proof. As is well-known, for every integer m,
z∈M∑zm={n0if n∣motherwise.
Define cn−1=1 and consider
\end{align*}z∈M∑z2f(z)f(ηz)=z∈M∑z2j=0∑n−1cjzjℓ=0∑n−1cℓ(ηz)ℓ=j=0∑n−1ℓ=0∑n−1cjcℓηℓz∈M∑zj+ℓ+2==j=0∑n−1ℓ=0∑n−1cjcℓηℓ{n0if n∣j+ℓ+2otherwise}=cn−12n+j=0∑n−2cjcn−2−jηn−2−jn=n=0.
Therefore there exists some b∈M such that f(b)=0 and
f(ηb)=0, i.e. b∈A, and a=ηb∈A,
satisfying ab−1=η.
By double-counting the elements of M, from the Claim we conclude
∣A∣(∣A∣−1)≥M∖{1}=n−1≥k2−3k+3>(k−1)(k−2)
which shows ∣A∣>k−1.
How the field did
contestants scored
315
average (of 10)
0.23
solved (≥ 80%)
1.9%
near-0 (≤ 10%)
97.1%
discrimination
0.42
Score distribution (field cohort)
Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.