fq_poly_factor_squarefree
Synopsis
#include <flint/fq_poly_factor.h>void fq_poly_factor_squarefree(fq_poly_factor_t res, const fq_poly_t f, const fq_ctx_t ctx)Sets res to a squarefree factorisation of f: pairwise coprime monic squarefree polynomials g_i with distinct exponents e_i such that f = c \prod g_i^{e_i}, where c is the leading coefficient of f. Previous contents of res are discarded; for f of length at most 1 the factorisation is empty.
Cite this page
The FLINT team, “fq_poly_factor_squarefree (fq_poly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_poly_factor/fq_poly_factor_squarefree.html (generated 2026-10-20).
@misc{flint-doc-fq-poly-factor-fq-poly-factor-squarefree,
author = {{The FLINT team}},
title = {{fq\_poly\_factor\_squarefree (fq\_poly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_poly_factor/fq_poly_factor_squarefree.html},
note = {Generated 2026-10-20}
}