FLINT3.7.0-dev

_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)source
void 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)source

Set RR to A mod BA \bmod B for the monic BB of length nn, as a linear combination of the precomputed residues of xix^i; this costs O(len⁡(A)⋅n)O(\operatorname{len}(A) \cdot n) coefficient operations and is fast for len⁡(A)<2n\operatorname{len}(A) < 2n. The underscore version reduces (A, m) in place, leaving the remainder in its low n−1n - 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-11-02).