_fmpz_mod_poly_is_squarefree_f, fmpz_mod_poly_is_squarefree_f
Synopsis
#include <flint/fmpz_mod_poly_factor.h>int _fmpz_mod_poly_is_squarefree_f(fmpz_t fac, const fmpz * f, slong len, const fmpz_mod_ctx_t ctx)sourceint fmpz_mod_poly_is_squarefree_f(fmpz_t fac, const fmpz_mod_poly_t f, const fmpz_mod_ctx_t ctx)sourceSquarefreeness test for a possibly composite modulus n: either sets fac to 1 and returns whether f is squarefree, or sets fac to a nontrivial factor of n and returns 0.
Cite this page
The FLINT team, “_fmpz_mod_poly_is_squarefree_f, fmpz_mod_poly_is_squarefree_f (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_f.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-factor-fmpz-mod-poly-is-squarefree-f,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_is\_squarefree\_f, fmpz\_mod\_poly\_is\_squarefree\_f (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_f.html},
note = {Generated 2026-10-20}
}