FLINT3.7.0-dev

_n_poly_mod_div, n_poly_mod_div, _n_poly_mod_rem, n_poly_mod_rem, _n_poly_mod_divrem, n_poly_mod_divrem, _n_poly_mod_divexact, n_poly_mod_divexact

Synopsis#include <flint/n_poly.h>
void _n_poly_mod_div(n_poly_t Q, const n_poly_t A, const n_poly_t B, nmod_t mod)source
void n_poly_mod_div(n_poly_t Q, const n_poly_t A, const n_poly_t B, nmod_t mod)source
void _n_poly_mod_rem(n_poly_t R, const n_poly_t A, const n_poly_t B, nmod_t mod)source
void n_poly_mod_rem(n_poly_t R, const n_poly_t A, const n_poly_t B, nmod_t mod)source
void _n_poly_mod_divrem(n_poly_t Q, n_poly_t R, const n_poly_t A, const n_poly_t B, nmod_t mod)source
void n_poly_mod_divrem(n_poly_t Q, n_poly_t R, const n_poly_t A, const n_poly_t B, nmod_t mod)source
void _n_poly_mod_divexact(n_poly_t Q, const n_poly_t A, const n_poly_t B, nmod_t mod)source
void n_poly_mod_divexact(n_poly_t Q, const n_poly_t A, const n_poly_t B, nmod_t mod)source

Euclidean division by a nonzero B with invertible leading coefficient: quotient, remainder, both, or the quotient of an exact division.

Cite this page

The FLINT team, “_n_poly_mod_div, n_poly_mod_div, _n_poly_mod_rem, n_poly_mod_rem, _n_poly_mod_divrem, n_poly_mod_divrem, _n_poly_mod_divexact, n_poly_mod_divexact (n_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/n_poly/_n_poly_mod_div.html (generated 2026-10-20).