_fmpz_mod_poly_powmod_ui_binexp, fmpz_mod_poly_powmod_ui_binexp, _fmpz_mod_poly_powmod_fmpz_binexp, fmpz_mod_poly_powmod_fmpz_binexp
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_powmod_ui_binexp(fmpz * res, const fmpz * poly, ulong e, const fmpz * f, slong lenf, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_powmod_ui_binexp(fmpz_mod_poly_t res, const fmpz_mod_poly_t poly, ulong e, const fmpz_mod_poly_t f, const fmpz_mod_ctx_t ctx)sourcevoid _fmpz_mod_poly_powmod_fmpz_binexp(fmpz * res, const fmpz * poly, const fmpz_t e, const fmpz * f, slong lenf, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_powmod_fmpz_binexp(fmpz_mod_poly_t res, const fmpz_mod_poly_t poly, const fmpz_t e, const fmpz_mod_poly_t f, const fmpz_mod_ctx_t ctx)sourceSet res to \mathit{poly}^e \bmod f by binary exponentiation, for e \ge 0. The underscore versions require e > 0, \mathit{lenf} > 1 and poly reduced modulo f and zero-padded to length \mathit{lenf} - 1; they write \mathit{lenf} - 1 coefficients.
Cite this page
The FLINT team, “_fmpz_mod_poly_powmod_ui_binexp, fmpz_mod_poly_powmod_ui_binexp, _fmpz_mod_poly_powmod_fmpz_binexp, fmpz_mod_poly_powmod_fmpz_binexp (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_powmod_ui_binexp.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-powmod-ui-binexp,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_powmod\_ui\_binexp, fmpz\_mod\_poly\_powmod\_ui\_binexp, \_fmpz\_mod\_poly\_powmod\_fmpz\_binexp, fmpz\_mod\_poly\_powmod\_fmpz\_binexp (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_powmod_ui_binexp.html},
note = {Generated 2026-10-20}
}