fmpz_mod_poly_frobenius_powers_2exp_precomp, fmpz_mod_poly_frobenius_powers_2exp_clear
Synopsis
#include <flint/fmpz_mod_poly.h>void fmpz_mod_poly_frobenius_powers_2exp_precomp(fmpz_mod_poly_frobenius_powers_2exp_t pow, const fmpz_mod_poly_t f, const fmpz_mod_poly_t finv, ulong m, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_frobenius_powers_2exp_clear(fmpz_mod_poly_frobenius_powers_2exp_t pow, const fmpz_mod_ctx_t ctx)sourceCompute (and free) the table of x^{p^{2^i}} \bmod f for 2^i \le m, where p is the modulus, given finv, the inverse of the reversal of f. The first entry is computed by exponentiation and each following one by modular composition of the previous one with itself.
Cite this page
The FLINT team, “fmpz_mod_poly_frobenius_powers_2exp_precomp, fmpz_mod_poly_frobenius_powers_2exp_clear (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_powers_2exp_precomp.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-frobenius-powers-2exp-precomp,
author = {{The FLINT team}},
title = {{fmpz\_mod\_poly\_frobenius\_powers\_2exp\_precomp, fmpz\_mod\_poly\_frobenius\_powers\_2exp\_clear (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_powers_2exp_precomp.html},
note = {Generated 2026-10-20}
}