fmpq_mpoly_factor_squarefree
Synopsis
#include <flint/fmpq_mpoly_factor.h>int fmpq_mpoly_factor_squarefree(fmpq_mpoly_factor_t f, const fmpq_mpoly_t A, const fmpq_mpoly_ctx_t ctx)sourceSets f to a factorisation of A whose bases are squarefree and pairwise coprime, computed with fmpz_mpoly_factor_squarefree on the integer part of A. One multiplicity can occur in several bases; to get one base for each multiplicity, sort with fmpq_mpoly_factor_sort and multiply the bases with equal exponents.
Cite this page
The FLINT team, “fmpq_mpoly_factor_squarefree (fmpq_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpq_mpoly_factor/fmpq_mpoly_factor_squarefree.html (generated 2026-10-20).
@misc{flint-doc-fmpq-mpoly-factor-fmpq-mpoly-factor-squarefree,
author = {{The FLINT team}},
title = {{fmpq\_mpoly\_factor\_squarefree (fmpq\_mpoly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpq_mpoly_factor/fmpq_mpoly_factor_squarefree.html},
note = {Generated 2026-10-20}
}