Eisenstein criterion says that a primitive integer polynomial is irreducible over if some prime divides all coefficients except the leading one, does not divide the leading coefficient, and its square does not divide the constant coefficient. The passage from primitive integer factorization to rational factorization is Gauss lemma for polynomials.
Translate the variable:
This is Eisenstein at two. Translation is an automorphism of , so itself is irreducible.
Set and . Since is a root of that irreducible degree-eight polynomial, . Also , so and solves . The extension degree is at most two. It is not one, since every element of is real and is not. The tower law for field extensions now gives

Articles by others on the same topic (0)

There are currently no matching articles.