 Eisenstein criterion

For a primitive polynomialif a prime $p$ does not divide $a_n$, divides every $a_j$ for $j<n$, and has $p^2\nmid a_0$, then $F$ is irreducible. If $F=GH$, reduction modulo $p$ forces both $\overline{G}$ and $\overline{H}$ to be positive-degree monomials. Their constant terms are consequently divisible by $p$, making $p^2\mid F(0)$, a contradiction. Gauss lemma for polynomials transfers the result between $\mathbb{Z}[X]$ and $\mathbb{Q}[X]$.