_fmpz_poly_div_preinv, fmpz_poly_div_preinv
Synopsis
#include <flint/fmpz_poly.h>void _fmpz_poly_div_preinv(fmpz * Q, const fmpz * A, slong len1, const fmpz * B, const fmpz * B_inv, slong len2)sourcevoid fmpz_poly_div_preinv(fmpz_poly_t Q, const fmpz_poly_t A, const fmpz_poly_t B, const fmpz_poly_t B_inv)sourceSet Q to the quotient of A by B, given the precomputed inverse B_inv of B, using a truncated product with the inverse (and splitting A into blocks if its quotient is longer than B). B must have leading coefficient \pm 1. The underscore version requires \mathit{len1} \ge \mathit{len2}, room for \mathit{len1} - \mathit{len2} + 1 coefficients in Q, and no aliasing.
Cite this page
The FLINT team, “_fmpz_poly_div_preinv, fmpz_poly_div_preinv (fmpz_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly/_fmpz_poly_div_preinv.html (generated 2026-10-20).
@misc{flint-doc-fmpz-poly-fmpz-poly-div-preinv,
author = {{The FLINT team}},
title = {{\_fmpz\_poly\_div\_preinv, fmpz\_poly\_div\_preinv (fmpz\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_poly/_fmpz_poly_div_preinv.html},
note = {Generated 2026-10-20}
}