_fmpz_poly_rem_powers_precomp, fmpz_poly_rem_powers_precomp
Synopsis
#include <flint/fmpz_poly.h>void _fmpz_poly_rem_powers_precomp(fmpz * A, slong m, const fmpz * B, slong n, fmpz ** const powers)sourcevoid fmpz_poly_rem_powers_precomp(fmpz_poly_t R, const fmpz_poly_t A, const fmpz_poly_t B, const fmpz_poly_powers_precomp_t B_inv)sourceSet R to A \bmod B for the monic B of length n, as a linear combination of the precomputed residues of x^i; this costs O(\operatorname{len}(A) \cdot n) coefficient operations and is fast for \operatorname{len}(A) < 2n. The underscore version reduces (A, m) in place, leaving the remainder in its low n - 1 coefficients, and does not allow aliasing.
Cite this page
The FLINT team, “_fmpz_poly_rem_powers_precomp, fmpz_poly_rem_powers_precomp (fmpz_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly/_fmpz_poly_rem_powers_precomp.html (generated 2026-10-20).
@misc{flint-doc-fmpz-poly-fmpz-poly-rem-powers-precomp,
author = {{The FLINT team}},
title = {{\_fmpz\_poly\_rem\_powers\_precomp, fmpz\_poly\_rem\_powers\_precomp (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_rem_powers_precomp.html},
note = {Generated 2026-10-20}
}