Skip to main content
OlympiadHQ

Browse · MathNet

Print

NMO Selection Tests for the Balkan and International Mathematical Olympiads

Romania algebra

Problem

Let be a prime number, let be positive integer numbers, and let be the greatest common divisor of the numbers . Prove that the polynomial is irreducible in .
Solution
Clearly, is a polynomial with integral coefficients. If all are equal, then , a constant polynomial; therefore assume at least two of the are distinct. By Gauss' Lemma, it is sufficient to prove irreducible in . We claim that the roots of all lie outside the closed unit disc in the complex plane. Assuming the claim, suppose, if possible, that is a non-trivial factorization of in . Since , a prime, one of the numbers , is 1. To reach a contradiction, notice that and are both products of roots of , all of which lie outside the closed unit disc, so and are both greater than 1.

Back to the claim, write Suppose, if possible, that has a root in the closed unit disc. Then which forces and whatever and . Consequently, the are all equal to some complex number , so that is, . Now write , for some integer numbers , to get Finally, to reach a contradiction, evaluate the formal derivatives of both sides of at . The left-hand side is , while the right-hand side vanishes.

Techniques

Irreducibility: Rational Root Theorem, Gauss's Lemma, EisensteinComplex numbersGreatest common divisors (gcd)