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

IMC / 2008 / Problems / Day 2, P10

IMC 2008 · Day 2 · P10

easy

Let Z[x]\mathbb{Z}[x] be the ring of polynomials with integer coefficients, and let f(x),g(x)Z[x]f(x), g(x) \in \mathbb{Z}[x] be nonconstant polynomials such that g(x)g(x) divides f(x)f(x) in Z[x]\mathbb{Z}[x]. Prove that if the polynomial f(x)2008f(x) - 2008 has at least 81 distinct integer roots, then the degree of g(x)g(x) is greater than 5.

Solution (official)

Let f(x)=g(x)h(x)f(x) = g(x) h(x) where h(x)h(x) is a polynomial with integer coefficients.

Let a1,,a81a_1, \dots, a_{81} be distinct integer roots of the polynomial f(x)2008f(x) - 2008. Then f(ai)=g(ai)h(ai)=2008f(a_i) = g(a_i) h(a_i) = 2008 for i=1,,81i = 1, \dots, 81, Hence, g(a1),,g(a81)g(a_1), \dots, g(a_{81}) are integer divisors of 2008.

Since 2008=232512008 = 2^3 \cdot 251 (2, 251 are primes) then 2008 has exactly 16 distinct integer divisors (including the negative divisors as well). By the pigeonhole principle, there are at least 6 equal numbers among g(a1),,g(a81)g(a_1), \dots, g(a_{81}) (because 81>16581 > 16 \cdot 5). For example, g(a1)=g(a2)==g(a6)=cg(a_1) = g(a_2) = \dots = g(a_6) = c. So g(x)cg(x) - c is a nonconstant polynomial which has at least 6 distinct roots (namely a1,,a6a_1, \dots, a_6). Then the degree of the polynomial g(x)cg(x) - c is at least 6.

How the field did

contestants scored
255
average (of 20)
11.09
solved (≥ 80%)
54.9%
near-0 (≤ 10%)
43.5%
discrimination
0.48

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 · P7easyavg 6.1/10 · solved 54% · near-0 22% · disc 0.56
IMC 2006 · Day 2 · P11mediumavg 3.8/10 · solved 35% · near-0 55% · disc 0.53
IMC 2008 · Day 1 · P3mediumavg 4.7/10 · solved 32% · near-0 26% · disc 0.64
IMC 2020 · Day 2 · P6hardavg 1.9/10 · solved 16% · near-0 72% · disc 0.45