A cubic over a field is reducible exactly when it has a root in that field. For modulo five, direct evaluation givesNo value is zero, so is irreducible in .
The integer polynomial in the second part reduces to precisely , because , and . It is monic, hence primitive, and its degree is preserved by reduction. The irreducibility by degree-preserving reduction modulo a prime criterion states that a primitive integer polynomial with irreducible reduction of the same degree is irreducible over the rationals. This follows from Gauss's lemma: a rational factorization would give integer factors whose leading coefficients remain nonzero modulo five, contradicting the irreducible reduction. Thus
Reduce the monic integer polynomial modulo . Every satisfies , so . Thus the reduction has no root in . If it had a proper factor, part 2 would force such a root, a contradiction. Hence it is irreducible over .
The criterion of irreducibility by degree-preserving reduction modulo a prime, which follows from Gauss's lemma, now applies because the polynomial is monic and its degree is preserved on reduction. Consequently is irreducible in .