_fmpz_mod_poly_invmod, fmpz_mod_poly_invmod
Synopsis
#include <flint/fmpz_mod_poly.h>int _fmpz_mod_poly_invmod(fmpz * A, const fmpz * B, slong lenB, const fmpz * P, slong lenP, const fmpz_mod_ctx_t ctx)sourceint fmpz_mod_poly_invmod(fmpz_mod_poly_t A, const fmpz_mod_poly_t B, const fmpz_mod_poly_t P, const fmpz_mod_ctx_t ctx)sourceIf B is invertible modulo P, set A to the inverse (reduced modulo P) and return 1; otherwise return 0, with A undefined. The modulus must be prime. fmpz_mod_poly_invmod raises an exception if \deg P < 1 and reduces B modulo P first. The underscore version requires 0 < \mathit{lenB} < \mathit{lenP} (allowing zero-padding of B), writes \mathit{lenP} - 1 coefficients and does not allow aliasing.
Cite this page
The FLINT team, “_fmpz_mod_poly_invmod, fmpz_mod_poly_invmod (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_invmod.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-invmod,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_invmod, fmpz\_mod\_poly\_invmod (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_invmod.html},
note = {Generated 2026-10-20}
}