My statement of Eisenstein's criterion is the following:(adsbygoogle = window.adsbygoogle || []).push({});

Let [itex]R[/itex] be an integral domain, [itex]P[/itex] be prime ideal of [itex]R[/itex] and [itex]f(x) = a_0 + a_1x + ... + a_n x^n \in R[x][/itex].

Suppose

(1) [itex]a_0 , a_1 , ... , a_{n-1} \in P[/itex]

(2) [itex]a_0 \in P[/itex] but [itex]a_0 \not\in P^2[/itex]

(3) [itex]a_n \not\in P[/itex]

Then [itex]f[/itex] has no divisors of degree [itex]d[/itex] such that [itex]1\leqslant d \leqslant n-1[/itex]. In particular if [itex]f[/itex] is primitive and (1)-(3) hold then [itex]f[/itex] is irreducible.

I would like to see an example of how we can use this criterion in the Gaussian integers [itex]R= \mathbb{Z}[/itex].

I know [itex]1+i[/itex] is a Gaussian prime so can I anyone give me a quick example of a polynomial with coefficients in [itex]\mathbb{Z}[/itex] and how to use this criterion?

I know how to use it when [itex]R=\mathbb{Z}[/itex], for example to show [itex]f(x)= x^2 -1 \in \mathbb{Z}[x][/itex] is irreducible we just check that for a prime [itex]p[/itex]: [itex]p | a_n[/itex], [itex]p | a_i[/itex] for all [itex]i<n[/itex] and [itex]p^2 \not | a_0[/itex] . I'm confused as to how to use the version of it above for a polynomial in [itex]\mathbb{Z}[x][/itex].

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Rings: Eisenstein criterion

**Physics Forums | Science Articles, Homework Help, Discussion**