Skip to main content
OlympiadHQ

Browse · MathNet

Print

Baltic Way 2019

Baltic Way 2019 algebra

Problem

Does there exist a polynomial with integer coefficients of degree four such that for any integer , the polynomial is either irreducible or has a rational root?
Solution
The answer is yes, and our example will be the polynomial . Assume that there exist a constant such that is reducible but has no rational zeros. This means that factors as the product of two irreducible quadratic polynomials. Since is monic so must the two factors be. Assume that . By expanding, we find that By comparing coefficients we see that , and . From the first equality we get , and the two others become and . From it follows that and has the same parity. Since and has the same parity, it follows that is either odd or divisible by 4 which is a contradiction. Hence for any integer is either irreducible or has a rational root, and the answer is therefore yes.
Final answer
Yes; for example f(x) = x^4 + 2x.

Techniques

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