fmpz_mod_poly_is_irreducible
Synopsis
#include <flint/fmpz_mod_poly_factor.h>int fmpz_mod_poly_is_irreducible(const fmpz_mod_poly_t f, const fmpz_mod_ctx_t ctx)sourceReturns whether f is irreducible over \mathbb{F}_p. As a special case, constant polynomials, including zero, are considered irreducible. This is gr_poly_is_irreducible, which uses the distinct-degree test for degree below 600 and a filter for small factors followed by Rabin's test for larger degrees; see Irreducibility testing over finite fields.
Cite this page
The FLINT team, “fmpz_mod_poly_is_irreducible (fmpz_mod_poly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly_factor/fmpz_mod_poly_is_irreducible.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-factor-fmpz-mod-poly-is-irreducible,
author = {{The FLINT team}},
title = {{fmpz\_mod\_poly\_is\_irreducible (fmpz\_mod\_poly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly_factor/fmpz_mod_poly_is_irreducible.html},
note = {Generated 2026-10-20}
}