_mpn_mod_poly_inv_series, _mpn_mod_poly_div_series
Synopsis
#include <flint/mpn_mod.h>int _mpn_mod_poly_div_series(nn_ptr Q, nn_srcptr A, slong lenA, nn_srcptr B, slong lenB, slong len, gr_ctx_t ctx)sourcePower series inversion Q = B^{-1} \bmod x^{\mathit{len}} and division Q = A / B \bmod x^{\mathit{len}}, with the conventions of _gr_poly_inv_series and _gr_poly_div_series (the constant term of B must be invertible). They use the basecase algorithms up to a tuned length of B (between 66 and 370 depending on the size of n; always for \mathit{lenB} \le 20) and Newton iteration above it.
Cite this page
The FLINT team, “_mpn_mod_poly_inv_series, _mpn_mod_poly_div_series (mpn_mod.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/mpn_mod/_mpn_mod_poly_inv_series.html (generated 2026-10-20).
@misc{flint-doc-mpn-mod-mpn-mod-poly-inv-series,
author = {{The FLINT team}},
title = {{\_mpn\_mod\_poly\_inv\_series, \_mpn\_mod\_poly\_div\_series (mpn\_mod.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/mpn_mod/_mpn_mod_poly_inv_series.html},
note = {Generated 2026-10-20}
}