fq_nmod_poly_is_irreducible, fq_nmod_poly_is_irreducible_ddf, fq_nmod_poly_is_irreducible_ben_or
Synopsis
#include <flint/fq_nmod_poly_factor.h>int fq_nmod_poly_is_irreducible(const fq_nmod_poly_t f, const fq_nmod_ctx_t ctx)int fq_nmod_poly_is_irreducible_ddf(const fq_nmod_poly_t f, const fq_nmod_ctx_t ctx)int fq_nmod_poly_is_irreducible_ben_or(const fq_nmod_poly_t f, const fq_nmod_ctx_t ctx)Return whether f is irreducible. Unlike gr_poly_is_irreducible, these functions return 1 for all polynomials of length at most 2, including constants and zero.
Generated from the same template as fq_poly_is_irreducible, whose documentation has the details.
Cite this page
The FLINT team, “fq_nmod_poly_is_irreducible, fq_nmod_poly_is_irreducible_ddf, fq_nmod_poly_is_irreducible_ben_or (fq_nmod_poly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_poly_factor/fq_nmod_poly_is_irreducible.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-factor-fq-nmod-poly-is-irreducible,
author = {{The FLINT team}},
title = {{fq\_nmod\_poly\_is\_irreducible, fq\_nmod\_poly\_is\_irreducible\_ddf, fq\_nmod\_poly\_is\_irreducible\_ben\_or (fq\_nmod\_poly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_poly_factor/fq_nmod_poly_is_irreducible.html},
note = {Generated 2026-10-20}
}