FLINT3.7.0-dev
/

_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)source
void 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)source

Set the nn entries of res to f0,f1,…,fn−1 mod gf^0, f^1, \ldots, f^{n-1} \bmod g by repeated multiplication. In the underscore version ff must be reduced modulo gg (with length flen>0\mathit{flen} > 0, possibly zero-padded), each res[i] must have space for glen−1\mathit{glen} - 1 coefficients, and ginv is the inverse of the reversal of gg. 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-11-02).