_fmpz_mod_poly_powmod_x_fmpz_preinv, fmpz_mod_poly_powmod_x_fmpz_preinv
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_powmod_x_fmpz_preinv(fmpz * res, const fmpz_t e, const fmpz * f, slong lenf, const fmpz * finv, slong lenfinv, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_powmod_x_fmpz_preinv(fmpz_mod_poly_t res, const fmpz_t e, const fmpz_mod_poly_t f, const fmpz_mod_poly_t finv, const fmpz_mod_ctx_t ctx)sourceSet res to x^e \bmod f for e \ge 0 by sliding-window exponentiation, given finv as above. Multiplications by x are shifts, which makes this cheaper than powering a general polynomial. The underscore version requires e > 0 and \mathit{lenf} > 2 and writes \mathit{lenf} - 1 coefficients.
Guides#
Cite this page
The FLINT team, “_fmpz_mod_poly_powmod_x_fmpz_preinv, fmpz_mod_poly_powmod_x_fmpz_preinv (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_x_fmpz_preinv.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-powmod-x-fmpz-preinv,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_powmod\_x\_fmpz\_preinv, fmpz\_mod\_poly\_powmod\_x\_fmpz\_preinv (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_x_fmpz_preinv.html},
note = {Generated 2026-10-20}
}