fmpz_mod_poly_frobenius_power
Synopsis
#include <flint/fmpz_mod_poly.h>void fmpz_mod_poly_frobenius_power(fmpz_mod_poly_t res, fmpz_mod_poly_frobenius_powers_2exp_t pow, const fmpz_mod_poly_t f, ulong m, const fmpz_mod_ctx_t ctx)sourceSets res to x^{p^m} \bmod f using the table pow from fmpz_mod_poly_frobenius_powers_2exp_precomp (computed for a bound at least m), by modular compositions of the table entries along the binary expansion of m (see Finite fields and the Frobenius map).
Cite this page
The FLINT team, “fmpz_mod_poly_frobenius_power (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_frobenius_power.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-frobenius-power,
author = {{The FLINT team}},
title = {{fmpz\_mod\_poly\_frobenius\_power (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_frobenius_power.html},
note = {Generated 2026-10-20}
}