Maths Olympiad Prep

Library / South African Mathematical Olympiad Third Round /27 of 31

South African Mathematical Olympiad Third Round

Algebra Difficulty 7.4 National Olympiad, round 2 Prove it South Africa

Determine all pairs (P,d)(P, d) of a polynomial PP with integer coefficients and an integer dd such that the equation P(x)−P(y)=dP(x) - P(y) = d, where xx and yy are integers and x≠yx \neq y, has infinitely many solutions.

Solution

Note first that x−yx - y divides P(x)−P(y)P(x) - P(y). So if d≠0d \neq 0, there are only finitely many possibilities for x−yx - y. For one of these possible values, let us denote it by aa, there must be

infinitely many pairs (x,y)(x, y) such that x−y=ax - y = a and P(x)−P(y)=dP(x) - P(y) = d. Note that
P(x)−P(x−a)−d P(x) - P(x - a) - d
is still a polynomial. The only way it can have infinitely many zeros is that it is identically zero. But then P(x)=dx/a+bP(x) = dx/a + b for some number bb.
This gives us the first set of solutions, consisting of an arbitrary integer dd and a polynomial P(x)=dx/a+bP(x) = dx/a + b, where aa is a (positive or negative) divisor of dd and bb an arbitrary integer. This includes the solution where d=0d = 0 and the polynomial P(x)P(x) is constant.
For the rest of this solution, we can assume that d=0d = 0. If the degree of the polynomial is odd, then there exist integers AA and BB such that P(x)P(x) is either increasing for x≥Ax \ge A and for x≤Bx \le B, or decreasing for x≥Ax \ge A and x≤Bx \le B. If P(x)P(x) is increasing for x≥Ax \ge A, then P(A)P(A), P(A+1)P(A + 1), P(A+2)P(A + 2), ... are a strictly increasing sequence of integers, thus distinct. Moreover, from some point on these numbers are all greater than the maximum of P(x)P(x) for x≤Ax \le A. Likewise, P(B)P(B), P(B−1)P(B - 1), P(B−2)P(B - 2), ... are a strictly decreasing sequence of integers, and from some point on they are all less than the minimum of P(x)P(x) for x≥Bx \ge B. This means that there cannot be infinitely many pairs x,yx, y with x≠yx \ne y such that P(x)−P(y)=0P(x) - P(y) = 0. The same argument applies if P(x)P(x) is decreasing for x≥Ax \ge A and x≤Bx \le B.
Thus P(x)P(x) must be a polynomial of even degree. Now there exist integers AA and BB such that P(x)P(x) is increasing for x≥Ax \ge A and decreasing for x≤Bx \le B, or vice versa. Thus there can only be infinitely many pairs x,yx, y with x≠yx \ne y such that P(x)−P(y)=0P(x) - P(y) = 0 if one of the two (x,y)(x, y) is ≥A\ge A while the other is ≤B\le B. We show that x+yx + y has to be constant for these solutions. Let the first terms of the polynomial be as follows:
P(x)=axn+bxn−1+… P(x) = ax^n + bx^{n-1} + \dots
Assume that aa is positive, for otherwise one can replace P(x)P(x) by −P(x)-P(x). If an(x+y)≥−2b+1an(x+y) \ge -2b+1, then we have
P(x)−P(−2b+1an−x)=xn−1+…, P(x) - P\left(\frac{-2b+1}{an} - x\right) = x^{n-1} + \dots,
where the dots stand for terms involving lower powers of xx. For large enough xx, this will be strictly positive, so P(x)−P(y)≠0P(x) - P(y) \ne 0. Likewise, if an(x+y)≤−2b−1an(x + y) \le -2b - 1, then we have
P(x)−P(−2b−1an−x)=−xn−1+…, P(x) - P\left(\frac{-2b-1}{an} - x\right) = -x^{n-1} + \dots,
which is negative for large enough xx. Hence P(x)−P(y)≠0P(x) - P(y) \ne 0 in this case as well. Thus there must be infinitely many solutions of P(x)−P(y)=0P(x) - P(y) = 0 with an(x+y)=−2ban(x + y) = -2b. In this case,
P(x)−P(−2ban−x) P(x) - P\left(\frac{-2b}{an} - x\right)
is a polynomial with infinitely many zeros, hence it is constant. Thus
P(x)=P(−2ban−x) P(x) = P\left(\frac{-2b}{an} - x\right)
for all xx, which gives
Q(x)=P(−ban+x)=P(−ban−x)=Q(−x) Q(x) = P\left(\frac{-b}{an} + x\right) = P\left(\frac{-b}{an} - x\right) = Q(-x)
for all xx. It follows that the polynomial Q(x)Q(x) can only contain even powers of xx, i.e. Q(x)=R(x2)Q(x) = R(x^2). This gives us the second set of solutions, consisting of a polynomial of the form P(x)=R((x−c)2)P(x) = R((x-c)^2), where 2c2c is an integer, and d=0d=0.

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

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