Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 4.2.4
Exercise 4.2.4
For each of the following polynomials, use a computer to determine whether it is irreducible over the given field.
- (a)
- over .
- (b)
- over and .
Answers
Proof.
- (a)
-
With Sage, the instructions
factor(x^4+x^3+x^2+x+2) factor(3*x^6+6*x^5+9*x^4+2*x^3+3*x^2+1);give the same polynomials.
So and are irreducible over .
- (b)
-
The instructions
K = NumberField(x^3-2, ’a’); L.<X> = PolynomialRing(K) p = 3*x^6 + 6*x^5 + 9*x^4 + 2*x^3 + 3*x^2 + 1 u = factor(p)give the following decomposition, where :
.
Thus is not irreducible over .
2022-07-19 00:00