_fmpz_mod_poly_xgcd_euclidean_f, fmpz_mod_poly_xgcd_euclidean_f, _fmpz_mod_poly_xgcd_f, fmpz_mod_poly_xgcd_f
Synopsis
#include <flint/fmpz_mod_poly.h>slong _fmpz_mod_poly_xgcd_euclidean_f(fmpz_t f, fmpz * G, fmpz * S, fmpz * T, const fmpz * A, slong lenA, const fmpz * B, slong lenB, const fmpz_t invB, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_xgcd_euclidean_f(fmpz_t f, fmpz_mod_poly_t G, fmpz_mod_poly_t S, fmpz_mod_poly_t T, const fmpz_mod_poly_t A, const fmpz_mod_poly_t B, const fmpz_mod_ctx_t ctx)sourceslong _fmpz_mod_poly_xgcd_f(fmpz_t f, fmpz * G, fmpz * S, fmpz * T, const fmpz * A, slong lenA, const fmpz * B, slong lenB, const fmpz_t invB, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_xgcd_f(fmpz_t f, fmpz_mod_poly_t G, fmpz_mod_poly_t S, fmpz_mod_poly_t T, const fmpz_mod_poly_t A, const fmpz_mod_poly_t B, const fmpz_mod_ctx_t ctx)sourceExtended GCD for a possibly composite modulus by the Euclidean algorithm: either set f = 1 and compute the outputs as in fmpz_mod_poly_xgcd (with the same conventions for the underscore versions, where invB is the inverse of the leading coefficient of B), or set f to a nontrivial factor of n. The _xgcd_f names are aliases of the _xgcd_euclidean_f functions.
Cite this page
The FLINT team, “_fmpz_mod_poly_xgcd_euclidean_f, fmpz_mod_poly_xgcd_euclidean_f, _fmpz_mod_poly_xgcd_f, fmpz_mod_poly_xgcd_f (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_xgcd_euclidean_f.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-xgcd-euclidean-f,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_xgcd\_euclidean\_f, fmpz\_mod\_poly\_xgcd\_euclidean\_f, \_fmpz\_mod\_poly\_xgcd\_f, fmpz\_mod\_poly\_xgcd\_f (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_xgcd_euclidean_f.html},
note = {Generated 2026-10-20}
}