gr_mpoly_divrem_weak, gr_mpoly_divrem_weak_heap_threaded, gr_mpoly_div_weak, gr_mpoly_div_weak_heap_threaded
Synopsis
#include <flint/gr_mpoly.h>int gr_mpoly_divrem_weak(gr_mpoly_t Q, gr_mpoly_t R, const gr_mpoly_t A, const gr_mpoly_t B, gr_mpoly_ctx_t ctx)sourceint gr_mpoly_divrem_weak_heap_threaded(gr_mpoly_t Q, gr_mpoly_t R, const gr_mpoly_t A, const gr_mpoly_t B, gr_mpoly_ctx_t ctx)sourceint gr_mpoly_div_weak(gr_mpoly_t Q, const gr_mpoly_t A, const gr_mpoly_t B, gr_mpoly_ctx_t ctx)sourceint gr_mpoly_div_weak_heap_threaded(gr_mpoly_t Q, const gr_mpoly_t A, const gr_mpoly_t B, gr_mpoly_ctx_t ctx)sourceWeak division with remainder over rings that are not fields: when a coefficient division by the leading coefficient of B is not exact, the coefficients are divided with remainder (gr_euclidean_divrem in the coefficient ring, the analogue of fmpz_fdiv_qr over \mathbb{Z}) and the remainder is kept, instead of failing. The result satisfies A = QB + R, but monomials of R may still be divisible by the leading monomial of B.
Guides#
Cite this page
The FLINT team, “gr_mpoly_divrem_weak, gr_mpoly_divrem_weak_heap_threaded, gr_mpoly_div_weak, gr_mpoly_div_weak_heap_threaded (gr_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/gr_mpoly/gr_mpoly_divrem_weak.html (generated 2026-10-20).
@misc{flint-doc-gr-mpoly-gr-mpoly-divrem-weak,
author = {{The FLINT team}},
title = {{gr\_mpoly\_divrem\_weak, gr\_mpoly\_divrem\_weak\_heap\_threaded, gr\_mpoly\_div\_weak, gr\_mpoly\_div\_weak\_heap\_threaded (gr\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/gr_mpoly/gr_mpoly_divrem_weak.html},
note = {Generated 2026-10-20}
}