FLINT3.7.0-dev

_fmpz_mod_add2, _fmpz_mod_sub2, _fmpz_mod_mul2

Synopsis#include <flint/fmpz_mod.h>
void _fmpz_mod_add2(fmpz_t a, const fmpz_t b, const fmpz_t c, const fmpz_mod_ctx_t ctx)source
void _fmpz_mod_sub2(fmpz_t a, const fmpz_t b, const fmpz_t c, const fmpz_mod_ctx_t ctx)source
void _fmpz_mod_mul2(fmpz_t a, const fmpz_t b, const fmpz_t c, const fmpz_mod_ctx_t ctx)source

For 2^{\mathtt{FLINT\_BITS}} < n < 2^{2\mathtt{FLINT\_BITS}}, with two- and three-limb arithmetic; _fmpz_mod_mul2 is the Barrett reduction of Two-limb Barrett reduction in fmpz_mod.

Cite this page

The FLINT team, “_fmpz_mod_add2, _fmpz_mod_sub2, _fmpz_mod_mul2 (fmpz_mod.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod/_fmpz_mod_add2.html (generated 2026-10-20).