_fmpz_mod_poly_is_squarefree, fmpz_mod_poly_is_squarefree
Synopsis
#include <flint/fmpz_mod_poly_factor.h>int _fmpz_mod_poly_is_squarefree(const fmpz * f, slong len, const fmpz_mod_ctx_t ctx)sourceint fmpz_mod_poly_is_squarefree(const fmpz_mod_poly_t f, const fmpz_mod_ctx_t ctx)sourceReturn whether f (given as (f, len) in the underscore version, with any \mathit{len} \ge 0) is squarefree, by testing whether \gcd(f, f') = 1 (gr_poly_is_squarefree). Nonzero constants are squarefree; as a special case, the zero polynomial is not.
Cite this page
The FLINT team, “_fmpz_mod_poly_is_squarefree, fmpz_mod_poly_is_squarefree (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_squarefree.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-factor-fmpz-mod-poly-is-squarefree,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_is\_squarefree, fmpz\_mod\_poly\_is\_squarefree (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_squarefree.html},
note = {Generated 2026-10-20}
}