Maths Olympiad Prep

Library / 11-th Czech-Slovak-Polish Match /4 of 5

11-th Czech-Slovak-Polish Match, 2011

Algebra Difficulty 5.7 AIME, harder Prove it Czech-Polish-Slovak Mathematical Match

Polynomial P(x)P(x) with integer coefficients satisfies the following condition: for every polynomials F(x)F(x), G(x)G(x), Q(x)Q(x) with integer coefficients, if
P(Q(x))=F(x)⋅G(x) P(Q(x)) = F(x) \cdot G(x)
then either F(x)F(x) or G(x)G(x) is a constant polynomial. Prove that P(x)P(x) has to be a constant polynomial.

Solution

For the sake of contradiction suppose that P(x)P(x) is not constant and consider the case when P(x)P(x) is a linear polynomial. It means that P(x)=ax+bP(x) = a x + b for some a,b∈Za, b \in \mathbb{Z}, where a≠0a \neq 0. Let Q(x)=ax2+(b+1)xQ(x) = a x^2 + (b+1)x. Then
P(Q(x))=a(ax2+(b+1)x)+b=a2x2+a(b+1)x+b=(ax+b)(ax+1) P(Q(x)) = a(a x^2 + (b+1)x) + b = a^2 x^2 + a(b+1)x + b = (a x + b)(a x + 1)
but polynomials ax+ba x + b and ax+1a x + 1 are not constant, a contradiction.

Now suppose that deg⁡P=n>1\deg P = n > 1. Suppose also that
P(x)=anxn+an−1xn−1+⋯+a1x+a0, P(x) = a_n x^n + a_{n-1} x^{n-1} + \dots + a_1 x + a_0,
where an≠0a_n \neq 0. Consider a polynomial Q(x)=P(x)+xQ(x) = P(x) + x. Clearly it has integer coefficients. Moreover,
P(Q(x))−P(x)=P(P(x)+x)−P(x)=∑i=0nai((P(x)+x)i−xi) P(Q(x)) - P(x) = P(P(x) + x) - P(x) = \sum_{i=0}^{n} a_i ((P(x) + x)^i - x^i)
From the formula
ai−bi=(a−b)(ai−1+ai−2b+⋯+bi−1) a^i - b^i = (a-b)(a^{i-1} + a^{i-2}b + \dots + b^{i-1})
it follows that the polynomial (P(x)+x)i−xi(P(x) + x)^i - x^i is divisible by the polynomial P(x)P(x). So P(Q(x))P(Q(x)) is divisible by P(x)P(x) as well. But this is a contradiction, since deg⁡P>1\deg P > 1 implies that the degree of P(Q(x))P(Q(x)) is greater than the degree of P(x)P(x), which means that P(x)P(x) is a non-trivial divisor of P(Q(x))P(Q(x)). Conclusion follows. □\square

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.