FLINT3.7.0-dev

_fmpz_mod_poly_reduce

Synopsis#include <flint/qadic.h>
void _fmpz_mod_poly_reduce(fmpz * R, slong lenR, const fmpz * a, const slong * j, slong len, const fmpz_t p)source

Like _fmpz_poly_reduce, followed by reduction of the remaining coefficients modulo p (typically a prime power) into [0, p).

Cite this page

The FLINT team, “_fmpz_mod_poly_reduce (qadic.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/qadic/_fmpz_mod_poly_reduce.html (generated 2026-10-20).