nmod_mpoly_divrem_ideal
Synopsis
#include <flint/nmod_mpoly.h>void nmod_mpoly_divrem_ideal(nmod_mpoly_struct ** Q, nmod_mpoly_t R, const nmod_mpoly_t A, nmod_mpoly_struct * const * B, slong len, const nmod_mpoly_ctx_t ctx)sourceDivides A by the len polynomials B[0], ..., B[len-1]: sets the quotients Q[i] and the remainder R with A = R + \sum_i Q_i B_i, where no term of R is divisible by the leading monomial of any B_i. At each step the leading remainder term is divided by the first B_i whose leading monomial divides it. The result depends on the order of the divisors unless they form a Gröbner basis.
Cite this page
The FLINT team, “nmod_mpoly_divrem_ideal (nmod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mpoly/nmod_mpoly_divrem_ideal.html (generated 2026-10-20).
@misc{flint-doc-nmod-mpoly-nmod-mpoly-divrem-ideal,
author = {{The FLINT team}},
title = {{nmod\_mpoly\_divrem\_ideal (nmod\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod_mpoly/nmod_mpoly_divrem_ideal.html},
note = {Generated 2026-10-20}
}