fmpz_mod_add_fmpz, fmpz_mod_add_ui, fmpz_mod_add_si, fmpz_mod_sub_fmpz, fmpz_mod_sub_ui, fmpz_mod_sub_si
Synopsis
#include <flint/fmpz_mod.h>void fmpz_mod_add_fmpz(fmpz_t a, const fmpz_t b, const fmpz_t c, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_add_ui(fmpz_t a, const fmpz_t b, ulong c, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_add_si(fmpz_t a, const fmpz_t b, slong c, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_sub_fmpz(fmpz_t a, const fmpz_t b, const fmpz_t c, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_sub_ui(fmpz_t a, const fmpz_t b, ulong c, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_sub_si(fmpz_t a, const fmpz_t b, slong c, const fmpz_mod_ctx_t ctx)sourceSet a to b + c or b - c modulo n, for canonical b and any integer c. The sum is computed exactly and reduced with fmpz_mod.
Guides#
Cite this page
The FLINT team, “fmpz_mod_add_fmpz, fmpz_mod_add_ui, fmpz_mod_add_si, fmpz_mod_sub_fmpz, fmpz_mod_sub_ui, fmpz_mod_sub_si (fmpz_mod.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod/fmpz_mod_add_fmpz.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-fmpz-mod-add-fmpz,
author = {{The FLINT team}},
title = {{fmpz\_mod\_add\_fmpz, fmpz\_mod\_add\_ui, fmpz\_mod\_add\_si, fmpz\_mod\_sub\_fmpz, fmpz\_mod\_sub\_ui, fmpz\_mod\_sub\_si (fmpz\_mod.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod/fmpz_mod_add_fmpz.html},
note = {Generated 2026-10-20}
}