In mathematics, Eisenstein's criterion gives an easily checked sufficient condition for a polynomial with integer coefficients to be irreducible over the rational numbers—that is, for it to be unfactorable into the product of non constant polynomials with rational coefficients. The result is also known as the Sch?nemann–Eisenstein theorem; although this name is rarely used nowadays, it was common in the early 20th century.