Maths Olympiad Prep

Library / /21 of 45

, 2010

Number theory Difficulty 8.5 Shortlist Prove it United States

Let P(x)P(x) be a polynomial with integer coefficients such that P(0)=0P(0) = 0 and
gcd(P(0),P(1),P(2),)=1. \text{gcd}(P(0), P(1), P(2), \dots) = 1.
Prove that there are infinitely many positive integers nn such that
gcd(P(n)P(0),P(n+1)P(1),P(n+2)P(2),)=n. \text{gcd}(P(n) - P(0), P(n+1) - P(1), P(n+2) - P(2), \dots) = n.

Solution

Write
P(x)=arxr+ar1xr1++a1x, P(x) = a_{r}x^{r} + a_{r-1}x^{r-1} + \dots + a_{1}x,
and consider its formal derivative
Q(x)=rarxr1+(r1)ar1xr2++a1. Q(x) = r a_{r} x^{r-1} + (r-1) a_{r-1} x^{r-2} + \dots + a_{1}.
Since PP is not identically zero, neither is QQ, so we may choose some positive integer mm such that Q(m)0Q(m) \neq 0. We claim that we may take nn to be any prime that does not divide Q(m)Q(m).
Let nn be such a prime, and put
d=gcd(P(n)P(0),P(n+1)P(1),P(n+2)P(2),). d = \text{gcd}(P(n) - P(0), P(n+1) - P(1), P(n+2) - P(2), \dots).
Certainly we have ndn \mid d. On the other hand, if qq is any prime distinct from nn, then we cannot have qdq \mid d. For suppose that qdq \mid d. Since qq and nn are relatively prime, there are integers k,l>0k, l > 0 such that knlq=1kn - lq = 1. Then, notice that
P(m)P(m+n)P(m+2n)P(m+kn)P(m+1)(modq) P(m) \equiv P(m+n) \equiv P(m+2n) \equiv \dots \equiv P(m+kn) \equiv P(m+1) \pmod{q}
for every nonnegative integer mm. By induction, then, qq divides all of P(0),P(1),P(2),P(0), P(1), P(2), \dots, contradicting the given.
Also, we cannot have n2dn^2 \mid d. Indeed,
P(m+n)P(m)=i=1rai[(m+n)imi]=i=1rai[mi+imi1n+(terms divisible by n2)mi]=i=1rai[imi1n+(terms divisible by n2)]nQ(m)(modn2). \begin{aligned} P(m+n) - P(m) &= \sum_{i=1}^{r} a_i [(m+n)^i - m^i] \\ &= \sum_{i=1}^{r} a_i [m^i + i m^{i-1} n + (\text{terms divisible by } n^2) - m^i] \\ &= \sum_{i=1}^{r} a_i [i m^{i-1} n + (\text{terms divisible by } n^2)] \\ &\equiv n \cdot Q(m) \pmod{n^2}. \end{aligned}
Therefore, P(m+n)P(m)P(m+n) - P(m) cannot be divisible by n2n^2 since Q(m)Q(m) is not divisible by nn.

So dd is divisible by nn, but not by any other prime or by n2n^2; hence d=nd = n, as required.

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.