##  [Eisenstein's Criterion](/eisensteins-criterion-0) 

 Definition

A sufficient irreducibility test for polynomials with integer coefficients: if there exists a prime p such that p divides all coefficients except the leading coefficient, p^2 does not divide the constant term, and p does not divide the leading coefficient, then the polynomial is irreducible over the rationals.

 

 

 

 

 

 





## Principle

Principle

Reduction modulo a prime p turns the polynomial into a nonconstant polynomial with a simple structure; the hypothesis forces any rational factorization to contradict the power-of-p divisibility of coefficients, so no nontrivial factorization in Q[x] can exist.

 

 

 

 

 





## Demonstration

Demonstration

Consider f(x)=x^3+6x^2+9x+3. Take p=3: 3 divides 6,9,3; 3 does not divide the leading coefficient 1; and 3^2=9 does not divide the constant term 3. Therefore by Eisenstein's criterion f is irreducible over Q.

 

 

 

 

## Misapplication

Misapplication

Applying Eisenstein without verifying the p^2 condition, using a composite 'p', or overlooking the possibility of a change of variable that might make Eisenstein applicable; also assuming necessity rather than sufficiency—many irreducible polynomials do not satisfy Eisenstein for any prime.

 

 

 

 

 





## Consequence

Consequence

Provides a powerful and easy-to-check sufficient condition for irreducibility over Q that can often be applied after a linear change of variable x→x+c; when applicable it yields an immediate conclusion and simplifies factorization tasks.

 

 

 

 

## Reversal

Reversal

Absence of a suitable prime p does not imply reducibility—the criterion is one-directional. However, one can sometimes apply the criterion to f(x+k) for integer k to detect irreducibility that is not visible in the original polynomial.

 

 

 

 

 





## Boundary

Boundary

Applies to polynomials with integer coefficients (or in UFDs with a chosen prime element) and gives sufficient but not necessary conditions; it does not handle polynomials where no prime meets the divisibility constraints, and it requires checking divisibility by powers of a prime.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Complementary to Gauss's Lemma and to computational factorization: Eisenstein is a specific, easily verifiable sufficient test, while Gauss provides structural reduction to integer coefficients; tensions arise because many irreducible polynomials evade Eisenstein yet are handled by other methods.

 

 

 

 

 





## Synthesis

Synthesis

Eisenstein's criterion is a concrete divisibility-based sufficient test: by finding a prime whose divisibility pattern among coefficients meets the criterion, one immediately concludes irreducibility over Q, often after a simple variable shift to meet the hypotheses.