_fmpz_mod_poly_divrem_f, fmpz_mod_poly_divrem_f, fmpz_mod_poly_rem_f
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_divrem_f(fmpz_t f, fmpz * Q, fmpz * R, const fmpz * A, slong lenA, const fmpz * B, slong lenB, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_divrem_f(fmpz_t f, 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_f(fmpz_t f, 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) for a possibly composite modulus: if the leading coefficient of B is invertible, sets f = 1 and computes the result; otherwise sets f to the nontrivial factor \gcd(\mathrm{lc}(B), n) of n and leaves Q and R unchanged. A zero B raises a division by zero exception.
Cite this page
The FLINT team, “_fmpz_mod_poly_divrem_f, fmpz_mod_poly_divrem_f, fmpz_mod_poly_rem_f (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_f.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-divrem-f,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_divrem\_f, fmpz\_mod\_poly\_divrem\_f, fmpz\_mod\_poly\_rem\_f (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_f.html},
note = {Generated 2026-10-20}
}