_nmod_pow_ui_binexp, _nmod_pow_ui_redc, _nmod_2_pow_ui_binexp
Synopsis
#include <flint/nmod.h>The algorithms behind nmod_pow_ui and nmod_2_pow_ui, with the same results. The first two require \mathit{exp} \ge 1 (they do not terminate for \mathit{exp} = 0), and _nmod_pow_ui_redc requires odd n. _nmod_2_pow_ui_binexp accepts any n and any exponent.
Cite this page
The FLINT team, “_nmod_pow_ui_binexp, _nmod_pow_ui_redc, _nmod_2_pow_ui_binexp (nmod.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod/_nmod_pow_ui_binexp.html (generated 2026-10-20).
@misc{flint-doc-nmod-nmod-pow-ui-binexp,
author = {{The FLINT team}},
title = {{\_nmod\_pow\_ui\_binexp, \_nmod\_pow\_ui\_redc, \_nmod\_2\_pow\_ui\_binexp (nmod.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod/_nmod_pow_ui_binexp.html},
note = {Generated 2026-10-20}
}