_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)sourcevoid 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)sourceSet res to \mathit{poly1} \cdot \mathit{poly2} \bmod f. The underscore version requires \mathit{len1} + \mathit{len2} - \mathit{lenf} > 0 (so that a reduction takes place), writes \mathit{lenf} - 1 coefficients and does not allow res to alias f. The leading coefficient of f 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-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-mulmod,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_mulmod, fmpz\_mod\_poly\_mulmod (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_mulmod.html},
note = {Generated 2026-10-20}
}