Maths Olympiad Prep

Library / /1 of 3

Algebra Difficulty 4.8 AIME Prove it United States

Problem:

Let g1(x),g2(x),,g5(x)g_{1}(x), g_{2}(x), \ldots, g_{5}(x) be polynomials with integer coefficients. Suppose that their product f(x)=g1(x)g2(x)g5(x)f(x) = g_{1}(x) g_{2}(x) \cdots g_{5}(x) satisfies f(1999)=2000f(1999) = 2000. Prove that for some i{1,2,3,4,5}i \in \{1,2,3,4,5\}, the sum of the coefficients of gi(x)g_{i}(x) is odd.

Solution

Solution:

For some ii, gi(1999)g_{i}(1999) is odd. Indeed, if this were false, each gi(1999)g_{i}(1999) would be divisible by 22, so their product, f(1999)=2000f(1999) = 2000, would be divisible by 252^{5}, which is not the case.

Now write gi(x)=cnxn+cn1xn1++c0g_{i}(x) = c_{n} x^{n} + c_{n-1} x^{n-1} + \cdots + c_{0}. Then
gi(1999)(cn++c0)=cn(1999n1)+cn1(1999n11)++c0(11), g_{i}(1999) - (c_{n} + \cdots + c_{0}) = c_{n}(1999^{n} - 1) + c_{n-1}(1999^{n-1} - 1) + \cdots + c_{0}(1 - 1),
which is even since 1999k11999^{k} - 1 is even for each kk. Since gi(1999)g_{i}(1999) is odd, cn++c0c_{n} + \cdots + c_{0} is also odd, as desired.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.