NN_ADD_2, NN_ADD_3, NN_ADD_4, NN_ADD_5, NN_ADD_6, NN_ADD_7, NN_ADD_8, NN_SUB_2, NN_SUB_3, NN_SUB_4, NN_SUB_5, NN_SUB_6, NN_SUB_7, NN_SUB_8
Synopsis
#include <flint/mpn_extras.h>NN_ADD_2(r, u, v)sourceNN_ADD_3(r, u, v)sourceNN_ADD_4(r, u, v)sourceNN_ADD_5(r, u, v)sourceNN_ADD_6(r, u, v)sourceNN_ADD_7(r, u, v)sourceNN_ADD_8(r, u, v)sourceNN_SUB_2(r, u, v)sourceNN_SUB_3(r, u, v)sourceNN_SUB_4(r, u, v)sourceNN_SUB_5(r, u, v)sourceNN_SUB_6(r, u, v)sourceNN_SUB_7(r, u, v)sourceNN_SUB_8(r, u, v)sourcer \gets u + v and r \gets u - v modulo B^k for the k-limb arrays r, u, v (2 \le k \le 8), as straight-line carry chains (the add_sssaaaaaa family of longlong.h), without carry in or out.
Cite this page
The FLINT team, “NN_ADD_2, NN_ADD_3, NN_ADD_4, NN_ADD_5, NN_ADD_6, NN_ADD_7, NN_ADD_8, NN_SUB_2, NN_SUB_3, NN_SUB_4, NN_SUB_5, NN_SUB_6, NN_SUB_7, NN_SUB_8 (mpn_extras.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/mpn_extras/NN_ADD_2.html (generated 2026-10-20).
@misc{flint-doc-mpn-extras-NN-ADD-2,
author = {{The FLINT team}},
title = {{NN\_ADD\_2, NN\_ADD\_3, NN\_ADD\_4, NN\_ADD\_5, NN\_ADD\_6, NN\_ADD\_7, NN\_ADD\_8, NN\_SUB\_2, NN\_SUB\_3, NN\_SUB\_4, NN\_SUB\_5, NN\_SUB\_6, NN\_SUB\_7, NN\_SUB\_8 (mpn\_extras.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/mpn_extras/NN_ADD_2.html},
note = {Generated 2026-10-20}
}