FLINT3.7.0-dev
/

_fmpz_mod_poly_mulmod, fmpz_mod_poly_mulmod

Synopsis#include <flint/fmpz_mod_poly.h>
void _fmpz_mod_poly_mulmod(fmpz * res, const fmpz * poly1, slong len1, const fmpz * poly2, slong len2, const fmpz * f, slong lenf, const fmpz_mod_ctx_t ctx)source
void fmpz_mod_poly_mulmod(fmpz_mod_poly_t res, const fmpz_mod_poly_t poly1, const fmpz_mod_poly_t poly2, const fmpz_mod_poly_t f, const fmpz_mod_ctx_t ctx)source

Set res to poly1⋅poly2 mod f\mathit{poly1} \cdot \mathit{poly2} \bmod f. The underscore version requires len1+len2−lenf>0\mathit{len1} + \mathit{len2} - \mathit{lenf} > 0 (so that a reduction takes place), writes lenf−1\mathit{lenf} - 1 coefficients and does not allow res to alias f. The leading coefficient of ff must be invertible (FLINT_IMPINV otherwise).

Cite this page

The FLINT team, “_fmpz_mod_poly_mulmod, fmpz_mod_poly_mulmod (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_mulmod.html (generated 2026-11-02).