Maths Olympiad Prep

Library / /9 of 9

Algebra Difficulty 7.0 National Olympiad Prove it Italy

Angela has available the polynomials x1x-1, (x1)(x2)(x-1)(x-2), (x1)(x2)(x3)(x-1)(x-2)(x-3), \ldots up to (x1)(x2)(x2017)(x2018)(x-1)(x-2) \cdots (x-2017)(x-2018), and she divides them into two groups. Letting p(x)p(x) be the product of the polynomials of the first group and q(x)q(x) that of the polynomials of the second group, Angela notices that the polynomial p(x)p(x) divides the polynomial q(x)q(x), and that the degree of the quotient q(x)p(x)\frac{q(x)}{p(x)} is as small as possible: what is the value of this degree?

Solution

The answer is 1009. First observe that Angela can assign the polynomials (x1)(x2)(x-1)(x-2), (x1)(x2)(x3)(x4)(x-1)(x-2)(x-3)(x-4), \cdots, (x1)(x2)(x2017)(x2018)(x-1)(x-2)\cdots(x-2017)(x-2018) (that is, those of even degree) to the group corresponding to p(x)p(x), and the others to the group corresponding to q(x)q(x). With this choice, the ratio p(x)/q(x)p(x)/q(x) equals
(x1)(x2)(x1)(x2)(x3)(x4)(x1)(x1)(x2)(x3)=(x2)(x4)(x2018), \frac{(x-1)(x-2) \cdot (x-1)(x-2)(x-3)(x-4) \cdots}{(x-1) \cdot (x-1)(x-2)(x-3) \cdots} = (x-2)(x-4) \cdots (x-2018),
which has degree 1009. To show that a smaller degree cannot be achieved, observe that there are exactly 2017 factors (x2)(x-2), exactly 2015 factors (x4)(x-4), and in general there is an odd number of factors (xk)(x-k) for every even kk. In order for the polynomial q(x)q(x) to divide the polynomial p(x)p(x), the number of factors xkx-k that appear in p(x)p(x) must be greater than or equal to the number of factors xkx-k that appear in q(x)q(x): if the total number of factors xkx-k is odd, in p(x)p(x) there must appear at least one more than in q(x)q(x). This reasoning shows that in the ratio p(x)/q(x)p(x)/q(x) there must appear at least one factor (x2)(x-2), at least one factor (x4)(x-4), ..., at least one factor (x2018)(x-2018), and therefore this ratio cannot have degree less than 1009.

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 translated into English from it; metadata (topic, difficulty) added by this project.