`_nmod_poly_mulmod_precond, nmod_poly_mulmod_precond`

Synopsis#include <flint/nmod_poly.h>

void _nmod_poly_mulmod_precond(nn_ptr res, const nmod_poly_mulmod_precond_t precond, nn_srcptr b, slong blen, nmod_t mod)

source

void nmod_poly_mulmod_precond(nmod_poly_t res, const nmod_poly_mulmod_precond_t precond, const nmod_poly_t b)source

Set res to $ab \bmod d$ for the $a$ and $d$ of precond. Require $b$ reduced modulo $d$ . The underscore version requires $\mathit{alen}, \mathit{blen} \ge 1$ , writes $\deg d$ coefficients (zero-padded) and does not allow res to overlap $b$ , $a$ or $d$ . The non-underscore version allows res to be $b$ , but not $a$ .

Guides#

Computing modulo a fixed polynomial

Cite this page

The FLINT team, “_nmod_poly_mulmod_precond, nmod_poly_mulmod_precond (nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_poly/_nmod_poly_mulmod_precond.html (generated 2026-11-02).

@misc{flint-doc-nmod-poly-nmod-poly-mulmod-precond,
  author       = {{The FLINT team}},
  title        = {{\_nmod\_poly\_mulmod\_precond, nmod\_poly\_mulmod\_precond (nmod\_poly.h)}},
  howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
  year         = {2026},
  url          = {https://flintlib.org/doc/nmod_poly/_nmod_poly_mulmod_precond.html},
  note         = {Generated 2026-11-02}
}

Edit this page · PDF version · Built with fdoc from 0a4634bf95