_fq_nmod_poly_mulmod, fq_nmod_poly_mulmod
Synopsis
#include <flint/fq_nmod_poly.h>void _fq_nmod_poly_mulmod(fq_nmod_struct * res, const fq_nmod_struct * poly1, slong len1, const fq_nmod_struct * poly2, slong len2, const fq_nmod_struct * f, slong lenf, const fq_nmod_ctx_t ctx)void fq_nmod_poly_mulmod(fq_nmod_poly_t res, const fq_nmod_poly_t poly1, const fq_nmod_poly_t poly2, const fq_nmod_poly_t f, const fq_nmod_ctx_t ctx)Set res to \mathit{poly1} \cdot \mathit{poly2} \bmod f. The underscore version requires \mathit{len1} + \mathit{len2} > \mathit{lenf} (the product must need reduction), writes \mathit{lenf} - 1 coefficients and needs space for len1 + len2 - 1 coefficients in res, which must not be aliased with f. fq_nmod_poly_mulmod throws FLINT_DIVZERO if f = 0.
Generated from the same template as _fq_poly_mulmod, whose documentation has the details.
Cite this page
The FLINT team, “_fq_nmod_poly_mulmod, fq_nmod_poly_mulmod (fq_nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_mulmod.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-mulmod,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_mulmod, fq\_nmod\_poly\_mulmod (fq\_nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_mulmod.html},
note = {Generated 2026-10-20}
}