_fmpz_mod_poly_mulmod_preinv, fmpz_mod_poly_mulmod_preinv
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_mulmod_preinv(fmpz * res, const fmpz * poly1, slong len1, const fmpz * poly2, slong len2, const fmpz * f, slong lenf, const fmpz * finv, slong lenfinv, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_mulmod_preinv(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_poly_t finv, const fmpz_mod_ctx_t ctx)sourceLike fmpz_mod_poly_mulmod, given finv, the inverse of the reversal of f modulo x^{\mathit{lenf}} (computed with fmpz_mod_poly_reverse and fmpz_mod_poly_inv_series). Both factors must be reduced modulo f (len1, len2 < \mathit{lenf}); otherwise an exception is raised.
Guides#
Cite this page
The FLINT team, “_fmpz_mod_poly_mulmod_preinv, fmpz_mod_poly_mulmod_preinv (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_preinv.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-mulmod-preinv,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_mulmod\_preinv, fmpz\_mod\_poly\_mulmod\_preinv (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_preinv.html},
note = {Generated 2026-10-20}
}