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

IMC / 2007 / Problems / Day 1, P1

IMC 2007 · Day 1 · P1

easy

Let ff be a polynomial of degree 2 with integer coefficients. Suppose that f(k)f(k) is divisible by 5 for every integer kk. Prove that all coefficients of ff are divisible by 5.

Solution 1 of 2 (official)

Let f(x)=ax2+bx+cf(x) = ax^2 + bx + c. Substituting x=0x = 0, x=1x = 1 and x=1x = -1, we obtain that 5f(0)=c5 \mid f(0) = c, 5f(1)=(a+b+c)5 \mid f(1) = (a + b + c) and 5f(1)=(ab+c)5 \mid f(-1) = (a - b + c). Then 5f(1)+f(1)2f(0)=2a5 \mid f(1) + f(-1) - 2 f(0) = 2a and 5f(1)f(1)=2b5 \mid f(1) - f(-1) = 2b. Therefore 5 divides 2a2a, 2b2b and cc and the statement follows.

Solution 2 of 2 (official)

Consider f(x)f(x) 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 f0(mod5)f \equiv 0 \pmod 5 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.

Similar problems

IMC 2008 · Day 2 · P10easyavg 5.5/10 · solved 55% · near-0 44% · disc 0.48
IMC 2008 · Day 2 · P7easyavg 6.1/10 · solved 54% · near-0 22% · disc 0.56