Eisenstein's Criterion

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.