_fmpz_mod_poly_divrem_basecase, fmpz_mod_poly_divrem_basecase, _fmpz_mod_poly_rem_basecase, fmpz_mod_poly_rem_basecase
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_divrem_basecase(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_basecase(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)sourcevoid _fmpz_mod_poly_rem_basecase(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_rem_basecase(fmpz_mod_poly_t R, const fmpz_mod_poly_t A, const fmpz_mod_poly_t B, const fmpz_mod_ctx_t ctx)sourceDivision with remainder, respectively remainder, by the classical algorithm in O(\mathit{lenB} (\mathit{lenA} - \mathit{lenB} + 1)) operations. In the underscore versions R (of length \mathit{lenA} for _fmpz_mod_poly_divrem_basecase, \mathit{lenB} - 1 for _fmpz_mod_poly_rem_basecase) may alias A, but no other aliasing is allowed.
Cite this page
The FLINT team, “_fmpz_mod_poly_divrem_basecase, fmpz_mod_poly_divrem_basecase, _fmpz_mod_poly_rem_basecase, fmpz_mod_poly_rem_basecase (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_basecase.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-divrem-basecase,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_divrem\_basecase, fmpz\_mod\_poly\_divrem\_basecase, \_fmpz\_mod\_poly\_rem\_basecase, fmpz\_mod\_poly\_rem\_basecase (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_basecase.html},
note = {Generated 2026-10-20}
}