Determine which of the polynomials below is (are) irreducible over Q. a. x5+9x4+12x2+6 b. x4+x+1
Solution:
(a) We can check whether is reducible over Q or not by Eisenstein's criterion.
Let (a prime number). We know that is the coefficient of highest power. Now, we notice that , but since and , i.e., divides all the other coefficients of given polynomial.
We also notice that
Thus, Eisenstein's criterion is satisfied and so, is irreducible over Q[x].
Answer: is irreducible over Q[x].
(b)We apply the mod 2 test.
is primitive. Thus is irreducible if and only if is irreducible.
The mod 2 reduction of is . Since
for all it follows that has no linear factors.
Suppose that is reducible. Then it must be the product of quadratic factors. There are 3 quadratic reducible polynomials in .Therefore there is 1 irreducible quadratic in which is since this polynomial has no roots in . Therefore which is not the case.
We have shown is irreducible. Thus is irreducible
which means is also.
Answer: irreducible over Q[x].
Comments