IMC / 2001 / Problems / Day 1, P4
IMC 2001 · Day 1 · P4
killerLet be a positive integer. Let be a polynomial of degree each of whose coefficients is , or , and which is divisible by . Let be a prime such that . Prove that the complex th roots of unity are roots of the polynomial .
Solution (official)
Let and (). As is well-known, the polynomial is irreducible, thus all are roots of , or none of them.
Suppose that none of is a root of . Then is a rational integer, which is not 0 and This contradicts the condition .
How the field did
contestants scored
182
average (of 20)
0.53
solved (≥ 80%)
1.6%
near-0 (≤ 10%)
95.1%
discrimination
0.32
Score distribution (field cohort)
Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.