Skip to main content
OlympiadHQ

Browse · MathNet

Print

Selection tests for the Gulf Mathematical Olympiad 2013

Saudi Arabia 2013 algebra

Problem

Let be a polynomial of integer coefficients where is a prime number. Assume that

Prove that is irreducible.
Solution
Assume that there exist two non-constant polynomials and with integer coefficients such that . Because is prime, we can assume that .

Because the modulus of the product of the complex roots of is equal to , at least one of these roots, say , has modulus less than or equal to . But . We deduce that which is a contradiction. Therefore, is irreducible.

Techniques

Irreducibility: Rational Root Theorem, Gauss's Lemma, EisensteinVieta's formulasComplex numbers