_fq_nmod_poly_is_squarefree, fq_nmod_poly_is_squarefree
Synopsis
#include <flint/fq_nmod_poly_factor.h>int _fq_nmod_poly_is_squarefree(const fq_nmod_struct * f, slong len, const fq_nmod_ctx_t ctx)int fq_nmod_poly_is_squarefree(const fq_nmod_poly_t f, const fq_nmod_ctx_t ctx)Return whether f is squarefree, that is, not divisible by the square of a polynomial of positive degree. Polynomials of length at most 2 other than 0 are squarefree, and 0 is not. This is a wrapper of gr_poly_is_squarefree, which computes \gcd(f, f') and handles p-th powers.
Generated from the same template as _fq_poly_is_squarefree, whose documentation has the details.
Cite this page
The FLINT team, “_fq_nmod_poly_is_squarefree, fq_nmod_poly_is_squarefree (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_squarefree.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-factor-fq-nmod-poly-is-squarefree,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_is\_squarefree, fq\_nmod\_poly\_is\_squarefree (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_squarefree.html},
note = {Generated 2026-10-20}
}