Skip to main content
OlympiadHQ

Browse · MathNet

Print

MMO2025 Round 2

Mongolia 2025 algebra

Problem

Prove that the polynomial is not the product of two non-constant polynomials with integer coefficients. (Otgonbayar Uuye)
Solution
Suppose, for contradiction, that can be written as the product of two non-constant polynomials with integer coefficients. Since is of degree , the only possible degrees for the factors are or .

First, check if has an integer root. If is an integer root, then , so divides (by the Rational Root Theorem). The divisors of are .

Check each possible :

- For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For : - For :

Therefore, has no integer roots, so it cannot have a linear factor with integer coefficients.

Now, suppose factors as the product of a quadratic and a cubic with integer coefficients:

Let , with .

Expand the product:



Set this equal to and compare coefficients:

- : - : - : - : - : - Constant:

Now, . Since , and are integer divisors of .

Try all possible pairs with and for some integer and .

But , so it has many divisors, but .

But for each such pair, must be solvable in integers .

But also, from above, .

Let us try , :

Then

Now,

So

This quadratic in has discriminant , which is not a perfect square, so is not integer.

Try , :





So

But , so

This is a quadratic in with huge coefficients, and it is clear that will not be integer.

Similarly, for other small divisors, the equations become unsolvable in integers.

Therefore, cannot be factored as a product of a quadratic and a cubic with integer coefficients.

Thus, is irreducible over , i.e., it cannot be written as the product of two non-constant polynomials with integer coefficients.

Techniques

Irreducibility: Rational Root Theorem, Gauss's Lemma, EisensteinPolynomial operations