FLINT3.7.0-dev

_fmpz_mod_poly_divrem_newton_n_preinv, fmpz_mod_poly_divrem_newton_n_preinv, _fmpz_mod_poly_div_newton_n_preinv, fmpz_mod_poly_div_newton_n_preinv

Synopsis#include <flint/fmpz_mod_poly.h>
void _fmpz_mod_poly_divrem_newton_n_preinv(fmpz * Q, fmpz * R, const fmpz * A, slong lenA, const fmpz * B, slong lenB, const fmpz * Binv, slong lenBinv, const fmpz_mod_ctx_t ctx)source
void fmpz_mod_poly_divrem_newton_n_preinv(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_poly_t Binv, const fmpz_mod_ctx_t ctx)source
void _fmpz_mod_poly_div_newton_n_preinv(fmpz * Q, const fmpz * A, slong lenA, const fmpz * B, slong lenB, const fmpz * Binv, slong lenBinv, const fmpz_mod_ctx_t ctx)source
void fmpz_mod_poly_div_newton_n_preinv(fmpz_mod_poly_t Q, const fmpz_mod_poly_t A, const fmpz_mod_poly_t B, const fmpz_mod_poly_t Binv, const fmpz_mod_ctx_t ctx)source

Division with remainder, respectively quotient only, given Binv, the inverse of the reversal of B modulo x^{\mathit{lenB}}: the quotient is a truncated product of the reversed A with Binv, and the remainder costs one more product. Requires \mathit{lenA} \le 2 \mathit{lenB} - 2; the non-underscore versions raise an exception otherwise.

Cite this page

The FLINT team, “_fmpz_mod_poly_divrem_newton_n_preinv, fmpz_mod_poly_divrem_newton_n_preinv, _fmpz_mod_poly_div_newton_n_preinv, fmpz_mod_poly_div_newton_n_preinv (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_newton_n_preinv.html (generated 2026-10-20).