_fmpz_mod_poly_divrem, fmpz_mod_poly_divrem
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_divrem(fmpz * Q, fmpz * R, const fmpz * A, slong lenA, const fmpz * B, slong lenB, const fmpz_t invB, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_divrem(fmpz_mod_poly_t Q, fmpz_mod_poly_t R, const fmpz_mod_poly_t A, const fmpz_mod_poly_t B, const fmpz_mod_ctx_t ctx)sourceCompute Q and R with A = BQ + R and \deg R < \deg B. The leading coefficient of B must be invertible; invB is its inverse. The underscore version requires \mathit{lenA} \ge \mathit{lenB} > 0, writes \mathit{lenA} - \mathit{lenB} + 1 coefficients of Q and \mathit{lenB} - 1 of R, allows zero-padding of A and no aliasing. A zero B raises FLINT_DIVZERO (except modulo 1).
Small cases (lenB at most 30 or quotients of length at most 11) use the classical algorithm; larger ones use Newton iteration (_gr_poly_divrem_newton, see Division with remainder), in O(M(\mathit{lenA})) operations.
The FLINT team, “_fmpz_mod_poly_divrem, fmpz_mod_poly_divrem (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_divrem.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-divrem,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_divrem, fmpz\_mod\_poly\_divrem (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_divrem.html},
note = {Generated 2026-10-20}
}