n_poly_mod_gcd, n_poly_mod_xgcd
Synopsis
#include <flint/n_poly.h>void n_poly_mod_xgcd(n_poly_t G, n_poly_t S, n_poly_t T, const n_poly_t A, const n_poly_t B, nmod_t mod)sourceSet G to the monic greatest common divisor of A and B, and for n_poly_mod_xgcd the cofactors with SA + TB = G (see nmod_poly_xgcd). The modulus must be prime.
Cite this page
The FLINT team, “n_poly_mod_gcd, n_poly_mod_xgcd (n_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/n_poly/n_poly_mod_gcd.html (generated 2026-10-20).
@misc{flint-doc-n-poly-n-poly-mod-gcd,
author = {{The FLINT team}},
title = {{n\_poly\_mod\_gcd, n\_poly\_mod\_xgcd (n\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/n_poly/n_poly_mod_gcd.html},
note = {Generated 2026-10-20}
}