fmpz_mod_mpoly_divrem_ideal
Synopsis
#include <flint/fmpz_mod_mpoly.h>void fmpz_mod_mpoly_divrem_ideal(fmpz_mod_mpoly_struct ** Q, fmpz_mod_mpoly_t R, const fmpz_mod_mpoly_t A, fmpz_mod_mpoly_struct * const * B, slong len, const fmpz_mod_mpoly_ctx_t ctx)sourceDivides A by the len polynomials B[i]: A = R + \sum_i Q_i B_i with no term of R divisible by any leading monomial of a B_i.
Cite this page
The FLINT team, “fmpz_mod_mpoly_divrem_ideal (fmpz_mod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_mpoly/fmpz_mod_mpoly_divrem_ideal.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-mpoly-fmpz-mod-mpoly-divrem-ideal,
author = {{The FLINT team}},
title = {{fmpz\_mod\_mpoly\_divrem\_ideal (fmpz\_mod\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_mpoly/fmpz_mod_mpoly_divrem_ideal.html},
note = {Generated 2026-10-20}
}