nmod_mpoly_div, nmod_mpoly_divrem
Synopsis
#include <flint/nmod_mpoly.h>void nmod_mpoly_div(nmod_mpoly_t Q, const nmod_mpoly_t A, const nmod_mpoly_t B, const nmod_mpoly_ctx_t ctx)sourcevoid nmod_mpoly_divrem(nmod_mpoly_t Q, nmod_mpoly_t R, const nmod_mpoly_t A, const nmod_mpoly_t B, const nmod_mpoly_ctx_t ctx)sourceSet Q and R to the quotient and the remainder of the division of A by B with respect to the monomial ordering: A = QB + R where no term of R is divisible by the leading monomial of B. nmod_mpoly_div only computes Q; when the division is known to be exact it is faster than nmod_mpoly_divides.
Cite this page
The FLINT team, “nmod_mpoly_div, nmod_mpoly_divrem (nmod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mpoly/nmod_mpoly_div.html (generated 2026-10-20).
@misc{flint-doc-nmod-mpoly-nmod-mpoly-div,
author = {{The FLINT team}},
title = {{nmod\_mpoly\_div, nmod\_mpoly\_divrem (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_div.html},
note = {Generated 2026-10-20}
}