_fmpz_mod_poly_pow_trunc, fmpz_mod_poly_pow_trunc, _fmpz_mod_poly_pow_trunc_binexp, fmpz_mod_poly_pow_trunc_binexp
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_pow_trunc(fmpz * res, const fmpz * poly, ulong e, slong trunc, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_pow_trunc(fmpz_mod_poly_t res, const fmpz_mod_poly_t poly, ulong e, slong trunc, const fmpz_mod_ctx_t ctx)sourcevoid _fmpz_mod_poly_pow_trunc_binexp(fmpz * res, const fmpz * poly, ulong e, slong trunc, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_pow_trunc_binexp(fmpz_mod_poly_t res, const fmpz_mod_poly_t poly, ulong e, slong trunc, const fmpz_mod_ctx_t ctx)sourceSet res to \mathit{poly}^e \bmod x^{\mathit{trunc}} by binary exponentiation with truncated products. The underscore versions require poly to be zero-padded to length trunc, \mathit{trunc} > 0 and e > 1, and do not allow aliasing.
Cite this page
The FLINT team, “_fmpz_mod_poly_pow_trunc, fmpz_mod_poly_pow_trunc, _fmpz_mod_poly_pow_trunc_binexp, fmpz_mod_poly_pow_trunc_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_pow_trunc.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-pow-trunc,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_pow\_trunc, fmpz\_mod\_poly\_pow\_trunc, \_fmpz\_mod\_poly\_pow\_trunc\_binexp, fmpz\_mod\_poly\_pow\_trunc\_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_pow_trunc.html},
note = {Generated 2026-10-20}
}