_n_fq_mul, _n_fq_addmul, n_fq_mul, n_fq_mul_fq_nmod, n_fq_addmul
Synopsis
#include <flint/n_poly.h>void _n_fq_mul(ulong * a, const ulong * b, const ulong * c, const fq_nmod_ctx_t ctx, ulong * t)sourcevoid _n_fq_addmul(ulong * a, const ulong * b, const ulong * c, const ulong * e, const fq_nmod_ctx_t ctx, ulong * t)sourcevoid n_fq_mul(ulong * a, const ulong * b, const ulong * c, const fq_nmod_ctx_t ctx)sourcevoid n_fq_mul_fq_nmod(ulong * a, const ulong * b, const fq_nmod_t c, const fq_nmod_ctx_t ctx)sourcevoid n_fq_addmul(ulong * a, const ulong * b, const ulong * c, const ulong * d, const fq_nmod_ctx_t ctx)sourceMultiplication a = bc and multiply-add a = b + c e (n_fq_addmul: a = b + c d). The underscore versions need scratch space of N_FQ_MUL_ITCH times d words.
Cite this page
The FLINT team, “_n_fq_mul, _n_fq_addmul, n_fq_mul, n_fq_mul_fq_nmod, n_fq_addmul (n_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/n_poly/_n_fq_mul.html (generated 2026-10-20).
@misc{flint-doc-n-poly-n-fq-mul,
author = {{The FLINT team}},
title = {{\_n\_fq\_mul, \_n\_fq\_addmul, n\_fq\_mul, n\_fq\_mul\_fq\_nmod, n\_fq\_addmul (n\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/n_poly/_n_fq_mul.html},
note = {Generated 2026-10-20}
}