IMC / 2007 / Problems / Day 1, P1
IMC 2007 · Day 1 · P1
easyLet be a polynomial of degree 2 with integer coefficients. Suppose that is divisible by 5 for every integer . Prove that all coefficients of are divisible by 5.
Solution 1 of 2 (official)
Let . Substituting , and , we obtain that , and . Then and . Therefore 5 divides , and and the statement follows.
Solution 2 of 2 (official)
Consider as a polynomial over the 5-element field (i.e. modulo 5). The polynomial has 5 roots while its degree is at most 2. Therefore and all of its coefficients are divisible by 5.
How the field did
contestants scored
242
average (of 20)
19.48
solved (≥ 80%)
96.7%
near-0 (≤ 10%)
0.0%
discrimination
0.16
Score distribution (field cohort)
Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.