nmod_poly_factor_squarefree
Synopsis
#include <flint/nmod_poly_factor.h>void nmod_poly_factor_squarefree(nmod_poly_factor_t res, const nmod_poly_t f)sourceSets res to the squarefree factorisation of f: monic squarefree polynomials g_i, pairwise coprime and with distinct exponents e_i, such that f = c \prod_i g_i^{e_i} with c the leading coefficient of f. A constant f gives the empty factorisation.
This is gr_poly_factor_squarefree: Yun's algorithm for the part with multiplicities prime to p, and recursion on the p-th root of the remaining part, which is a polynomial in x^p. See Squarefree factorisation.
Cite this page
The FLINT team, “nmod_poly_factor_squarefree (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_factor_squarefree.html (generated 2026-10-20).
@misc{flint-doc-nmod-poly-factor-nmod-poly-factor-squarefree,
author = {{The FLINT team}},
title = {{nmod\_poly\_factor\_squarefree (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_factor_squarefree.html},
note = {Generated 2026-10-20}
}