fmpz_mod_poly_powmod_linear_fmpz_preinv
Synopsis
#include <flint/fmpz_mod_poly.h>void fmpz_mod_poly_powmod_linear_fmpz_preinv(fmpz_mod_poly_t res, const fmpz_t a, const fmpz_t e, const fmpz_mod_poly_t f, const fmpz_mod_poly_t finv, const fmpz_mod_ctx_t ctx)sourceSets res to (x + a)^e \bmod f for e \ge 0, given finv as above, by binary exponentiation in which the multiplications by x + a are done in linear time. Used in root finding. A negative e raises an exception.
Cite this page
The FLINT team, “fmpz_mod_poly_powmod_linear_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_linear_fmpz_preinv.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-powmod-linear-fmpz-preinv,
author = {{The FLINT team}},
title = {{fmpz\_mod\_poly\_powmod\_linear\_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_linear_fmpz_preinv.html},
note = {Generated 2026-10-20}
}