Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 5.1.8
Exercise 5.1.8
Let n be a positive integer. Then the polynomial is irreducible over by the Schönemann-Eisenstein Criterion for the prime 2.
- (a)
- Determine the splitting field of over .
- (b)
- Show that when is prime.
Answers
Proof.
- (a)
-
The set of the roots of
is
, where
: the splitting field
of
over
is so
.
As , .
- (b)
-
Suppose that
is prime.
As is irreducible over , is the minimal polynomial of over , so .
As is prime, is irreducible over , thus .
From the Tower Theorem,
Thus and .
As are relatively prime,
Moreover, the minimal polynomial of over divides , thus . By (1), , and by (2) , thus