Maths Olympiad Prep

Track / Stage 5 / 73 of 400 #673 of 1964

Problem 673

AIME late
Algebra Difficulty 5.1 Prove it Serbian Mathematical Olympiad · Serbia

Find all monic polynomials P(x)P(x) such that the polynomial P(x)21P(x)^2-1 is divisible by the polynomial P(x+1)P(x+1).

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Solution:

The only solutions are the polynomials P(x)=1P(x)=1 and P(x)=xcP(x)=x-c, where cc is a constant.

Suppose that P(x)=(xc)(xx2)(xxn)P(x)=(x-c)\left(x-x_{2}\right) \cdots\left(x-x_{n}\right) is a nonconstant polynomial, where cc is its complex root whose real part is the smallest.

By the condition of the problem, x+1cx+1-c divides P(x)21P(x)^2-1, from which it follows that P(c1)=±1P(c-1)= \pm 1. On the other hand, for 2in2 \leqslant i \leqslant n we have c1xi1\left|c-1-x_{i}\right| \geqslant 1, so P(c1)=i=2nc1xi1|P(c-1)|=\prod_{i=2}^{n}\left|c-1-x_{i}\right| \geqslant 1, and this is only possible if c1xi=1\left|c-1-x_{i}\right|=1, i.e. xi=cx_{i}=c for all ii.

It follows that P(x)=(xc)nP(x)=(x-c)^{n}. However, P(x+c)21=x2n1P(x+c)^2-1=x^{2 n}-1 is not divisible by P(x+c+1)=(x+1)nP(x+c+1)=(x+1)^{n} if n2n \geqslant 2, so the only possibility is n=1n=1.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from sr; metadata (topic, difficulty, ordering) added by this project.