fmpz_mod_poly_is_irreducible_ddf, fmpz_mod_poly_is_irreducible_rabin
Synopsis
#include <flint/fmpz_mod_poly_factor.h>int fmpz_mod_poly_is_irreducible_ddf(const fmpz_mod_poly_t f, const fmpz_mod_ctx_t ctx)sourceint fmpz_mod_poly_is_irreducible_rabin(const fmpz_mod_poly_t f, const fmpz_mod_ctx_t ctx)sourceReturn whether f is irreducible, using the distinct-degree test (gr_poly_is_irreducible_ddf) or Rabin's test with the Frobenius powers computed by modular composition (gr_poly_is_irreducible_rabin). Constants are considered irreducible.
Cite this page
The FLINT team, “fmpz_mod_poly_is_irreducible_ddf, fmpz_mod_poly_is_irreducible_rabin (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_ddf.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-factor-fmpz-mod-poly-is-irreducible-ddf,
author = {{The FLINT team}},
title = {{fmpz\_mod\_poly\_is\_irreducible\_ddf, fmpz\_mod\_poly\_is\_irreducible\_rabin (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_ddf.html},
note = {Generated 2026-10-20}
}