Olympiad Maths Prep

Track / Stage 6 / 2 of 400 #1002 of 2000

Problem 1002

National olympiad, first round
Number theory Difficulty 6.0 Prove it

2. Show that there does not exist a polynomial with integer coefficients such that P(a)=b,P(b)=c,P(c)=aP(a)=b, P(b)=c, P(c)=a, where a,ba, b and cc are three distinct integers.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

Solution. Let P(x)=anxn+an1xn1++a1x+a0P(x)=a_{n} x^{n}+a_{n-1} x^{n-1}+\ldots+a_{1} x+a_{0}. We observe that

P(a)P(b)ab=an(anbn)+an1(an1bn1)++a1(ab)ab \frac{P(a)-P(b)}{a-b}=\frac{a_{n}\left(a^{n}-b^{n}\right)+a_{n-1}\left(a^{n-1}-b^{n-1}\right)+\ldots+a_{1}(a-b)}{a-b}

and this is an integer because the coefficients aka_{k} are integers and akbka^{k}-b^{k} is divisible by aba-b for k=1,2,3,,nk=1,2,3, \ldots, n. For the same reasons, P(b)P(c)bc\frac{P(b)-P(c)}{b-c} and P(c)P(a)ca\frac{P(c)-P(a)}{c-a} are also integers.

Assume for the polynomial PP that P(a)=b,P(b)=cP(a)=b, P(b)=c, and P(c)=aP(c)=a, where a,ba, b, and cc are distinct integers. From the previous discussion, we have that bcab,cabc\frac{b-c}{a-b}, \frac{c-a}{b-c}, and abca\frac{a-b}{c-a} are integers. Since their product is equal to 1, each of them must be equal to 1 or -1. If the first number is equal to -1, we get a=ca=c, which contradicts the assumption. For the same reasons, the other two numbers cannot be equal to -1. Therefore, all three numbers are equal to 1. From this, we get

bc=abca=bcab=ca \begin{aligned} & b-c=a-b \\ & c-a=b-c \\ & a-b=c-a \end{aligned}

Subtracting the second equation from the first, we get b=cb=c, which contradicts the assumption. Therefore, there is no polynomial with the desired properties.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.