_fmpz_mod_poly_inv_series, fmpz_mod_poly_inv_series
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_inv_series(fmpz * Qinv, const fmpz * Q, slong Qlen, slong n, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_inv_series(fmpz_mod_poly_t Qinv, const fmpz_mod_poly_t Q, slong n, const fmpz_mod_ctx_t ctx)sourceSet Qinv to the inverse of the power series Q modulo x^n, n \ge 1, by Newton iteration (_gr_poly_inv_series). The constant term of Q must be invertible: zero raises FLINT_DIVZERO, a non-invertible nonzero value (composite modulus) another exception. The underscore version writes n coefficients and does not allow aliasing.
Guides#
Cite this page
The FLINT team, “_fmpz_mod_poly_inv_series, fmpz_mod_poly_inv_series (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_inv_series.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-inv-series,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_inv\_series, fmpz\_mod\_poly\_inv\_series (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_inv_series.html},
note = {Generated 2026-10-20}
}