_fmpz_mod_poly_radix
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_radix(fmpz ** B, const fmpz * F, fmpz ** Rpow, fmpz ** Rinv, slong degR, slong k, slong i, fmpz * W, const fmpz_mod_ctx_t ctx)sourceThe recursive step of fmpz_mod_poly_radix: F has length 2^{i+1} \deg R (zero-padded), k is the number of digits already accounted for (0 at the top level), every B[j] has space for \deg R coefficients, and W is scratch space of length 2^{i+1} \deg R.
Cite this page
The FLINT team, “_fmpz_mod_poly_radix (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_radix.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-radix,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_radix (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_radix.html},
note = {Generated 2026-10-20}
}