fmpz_mod_poly_frobenius_powers_precomp, fmpz_mod_poly_frobenius_powers_clear
Synopsis
#include <flint/fmpz_mod_poly.h>void fmpz_mod_poly_frobenius_powers_precomp(fmpz_mod_poly_frobenius_powers_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_clear(fmpz_mod_poly_frobenius_powers_t pow, const fmpz_mod_ctx_t ctx)sourceCompute (and free) the table of all x^{p^k} \bmod f for 0 \le k \le m, given finv.
Cite this page
The FLINT team, “fmpz_mod_poly_frobenius_powers_precomp, fmpz_mod_poly_frobenius_powers_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_precomp.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-frobenius-powers-precomp,
author = {{The FLINT team}},
title = {{fmpz\_mod\_poly\_frobenius\_powers\_precomp, fmpz\_mod\_poly\_frobenius\_powers\_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_precomp.html},
note = {Generated 2026-10-20}
}