_fmpz_mod_poly_mulmid, fmpz_mod_poly_mulmid
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_mulmid(fmpz * res, const fmpz * poly1, slong len1, const fmpz * poly2, slong len2, slong nlo, slong nhi, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_mulmid(fmpz_mod_poly_t res, const fmpz_mod_poly_t poly1, const fmpz_mod_poly_t poly2, slong nlo, slong nhi, const fmpz_mod_ctx_t ctx)sourceSet res to the coefficients of index \mathit{nlo} \le i < \mathit{nhi} of the product, that is, to ((\mathit{poly1} \cdot \mathit{poly2}) \bmod x^{\mathit{nhi}}) / x^{\mathit{nlo}}. The underscore version requires positive lengths and 0 \le \mathit{nlo} < \mathit{nhi} \le \mathit{len1} + \mathit{len2} - 1, writes \mathit{nhi} - \mathit{nlo} coefficients and does not allow aliasing.
Cite this page
The FLINT team, “_fmpz_mod_poly_mulmid, fmpz_mod_poly_mulmid (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_mulmid.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-mulmid,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_mulmid, fmpz\_mod\_poly\_mulmid (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_mulmid.html},
note = {Generated 2026-10-20}
}