Olympiad Maths Prep

Track / Stage 5 / 386 of 400 #986 of 2000

Problem 986

AIME late
Number theory Difficulty 6.0 Prove it

Theorem 5 (Generalization of Eisenstein's Criterion) Let
f(x)=cnxn+cn1xn1++c0 f(x)=c_{n} x^{n}+c_{n-1} x^{n-1}+\cdots+c_{0}

be a polynomial with integer coefficients. Suppose there exists a prime pp and a natural number mnm \leqslant n, such that
(i) pcnp \nmid c_{n},
(ii) pcj(j=0,1,,m1)p \mid c_{j}(j=0,1, \cdots, m-1),
(iii) p2c0p^{2} \nmid c_{0}.

Then f(x)f(x) has an irreducible factor (with integer coefficients) of degree m\geqslant m.

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

To prove the following statement: If ff can be factored into the product of two integer-coefficient polynomials φ\varphi and ψ\psi
f(x)=φ(x)ψ(x), f(x) = \varphi(x) \psi(x),
then one of φ\varphi and ψ\psi has a degree m\geqslant m, and this polynomial (for the same pp and mm) satisfies similar conditions (i), (ii), and (iii).

Let us prove this statement. Suppose
φ(x)=arxr+ar1xr1++a0,ψ(x)=bsxs+bs1xs1++b0. \begin{array}{l} \varphi(x) = a_{r} x^{r} + a_{r-1} x^{r-1} + \cdots + a_{0}, \\ \psi(x) = b_{s} x^{s} + b_{s-1} x^{s-1} + \cdots + b_{0}. \end{array}

Since pc0=a0b0p \mid c_{0} = a_{0} b_{0} and p2c0=a0b0p^{2} \nmid c_{0} = a_{0} b_{0}, we can assume without loss of generality that pa0p \mid a_{0}, p2a0p^{2} \nmid a_{0}, and pb0p \nmid b_{0}. Also, since pcn=arbsp \nmid c_{n} = a_{r} b_{s} and parp \nmid a_{r}, we can assume without loss of generality that aka_{k} is the first among a0,a1,,ara_{0}, a_{1}, \cdots, a_{r} that is not divisible by pp. Consider
ck=akb0+ak1b1++a0bk. c_{k} = a_{k} b_{0} + a_{k-1} b_{1} + \cdots + a_{0} b_{k}.

We know that pckp \nmid c_{k}, hence kmk \geqslant m. We confirm that the polynomial φ\varphi satisfies the following conditions:
(i) parp \nmid a_{r},
(ii) paj (j=0,1,,m1)p \mid a_{j} \ (j=0,1, \cdots, m-1),
(iii) p2a0p^{2} \nmid a_{0}.

If φ\varphi is irreducible, then the conclusion of the theorem is already proven. Otherwise, we can repeat a similar discussion until we obtain an irreducible factor with a degree m\geqslant m.

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