_fmpz_mod_poly_powmod_ui_binexp_preinv, fmpz_mod_poly_powmod_ui_binexp_preinv, _fmpz_mod_poly_powmod_fmpz_binexp_preinv, fmpz_mod_poly_powmod_fmpz_binexp_preinv
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_powmod_ui_binexp_preinv(fmpz * res, const fmpz * poly, ulong e, const fmpz * f, slong lenf, const fmpz * finv, slong lenfinv, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_powmod_ui_binexp_preinv(fmpz_mod_poly_t res, const fmpz_mod_poly_t poly, ulong e, const fmpz_mod_poly_t f, const fmpz_mod_poly_t finv, const fmpz_mod_ctx_t ctx)sourcevoid _fmpz_mod_poly_powmod_fmpz_binexp_preinv(fmpz * res, const fmpz * poly, 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_fmpz_binexp_preinv(fmpz_mod_poly_t res, const fmpz_mod_poly_t poly, const fmpz_t e, const fmpz_mod_poly_t f, const fmpz_mod_poly_t finv, const fmpz_mod_ctx_t ctx)sourceLike the previous functions, given finv, the inverse of the reversal of f modulo x^{\mathit{lenf}}, so that each reduction modulo f costs two multiplications.
Cite this page
The FLINT team, “_fmpz_mod_poly_powmod_ui_binexp_preinv, fmpz_mod_poly_powmod_ui_binexp_preinv, _fmpz_mod_poly_powmod_fmpz_binexp_preinv, fmpz_mod_poly_powmod_fmpz_binexp_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_ui_binexp_preinv.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-powmod-ui-binexp-preinv,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_powmod\_ui\_binexp\_preinv, fmpz\_mod\_poly\_powmod\_ui\_binexp\_preinv, \_fmpz\_mod\_poly\_powmod\_fmpz\_binexp\_preinv, fmpz\_mod\_poly\_powmod\_fmpz\_binexp\_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_ui_binexp_preinv.html},
note = {Generated 2026-10-20}
}