nmod_poly_is_irreducible_ddf
Synopsis
#include <flint/nmod_poly_factor.h>int nmod_poly_is_irreducible_ddf(const nmod_poly_t f)sourceReturns whether f is irreducible, by the coarse phase of the baby-step giant-step distinct-degree factorisation: after a squarefreeness test, f is irreducible if and only if it has no factor of degree at most \deg(f)/2. Constants are considered irreducible. This is gr_poly_is_irreducible_ddf; it stops at the first interval of degrees that contains a factor.
Cite this page
The FLINT team, “nmod_poly_is_irreducible_ddf (nmod_poly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_poly_factor/nmod_poly_is_irreducible_ddf.html (generated 2026-10-20).
@misc{flint-doc-nmod-poly-factor-nmod-poly-is-irreducible-ddf,
author = {{The FLINT team}},
title = {{nmod\_poly\_is\_irreducible\_ddf (nmod\_poly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod_poly_factor/nmod_poly_is_irreducible_ddf.html},
note = {Generated 2026-10-20}
}