_fmpz_mod_poly_powers_mod_preinv_naive, fmpz_mod_poly_powers_mod_naive
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_powers_mod_preinv_naive(fmpz ** res, const fmpz * f, slong flen, slong n, const fmpz * g, slong glen, const fmpz * ginv, slong ginvlen, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_powers_mod_naive(fmpz_mod_poly_struct * res, const fmpz_mod_poly_t f, slong n, const fmpz_mod_poly_t g, const fmpz_mod_ctx_t ctx)sourceSet the n entries of res to f^0, f^1, \ldots, f^{n-1} \bmod g by repeated multiplication. In the underscore version f must be reduced modulo g (with length \mathit{flen} > 0, possibly zero-padded), each res[i] must have space for \mathit{glen} - 1 coefficients, and ginv is the inverse of the reversal of g. The entries of res must not alias the inputs.
Cite this page
The FLINT team, “_fmpz_mod_poly_powers_mod_preinv_naive, fmpz_mod_poly_powers_mod_naive (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_powers_mod_preinv_naive.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-powers-mod-preinv-naive,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_powers\_mod\_preinv\_naive, fmpz\_mod\_poly\_powers\_mod\_naive (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_powers_mod_preinv_naive.html},
note = {Generated 2026-10-20}
}