_fmpz_mod_poly_gcd_euclidean_f, fmpz_mod_poly_gcd_euclidean_f, _fmpz_mod_poly_gcd_f, fmpz_mod_poly_gcd_f
#include <flint/fmpz_mod_poly.h>slong _fmpz_mod_poly_gcd_euclidean_f(fmpz_t f, fmpz * G, const fmpz * A, slong lenA, const fmpz * B, slong lenB, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_gcd_euclidean_f(fmpz_t f, fmpz_mod_poly_t G, const fmpz_mod_poly_t A, const fmpz_mod_poly_t B, const fmpz_mod_ctx_t ctx)sourceslong _fmpz_mod_poly_gcd_f(fmpz_t f, fmpz * G, const fmpz * A, slong lenA, const fmpz * B, slong lenB, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_gcd_f(fmpz_t f, fmpz_mod_poly_t G, const fmpz_mod_poly_t A, const fmpz_mod_poly_t B, const fmpz_mod_ctx_t ctx)sourceGCD for a possibly composite modulus by the Euclidean algorithm: either sets f = 1 and computes G as in fmpz_mod_poly_gcd (the underscore versions returning its length), or sets f to a nontrivial factor of n met as a non-invertible leading coefficient of a remainder, with G undefined (the underscore versions then return 0). The _gcd_f names are aliases of the _gcd_euclidean_f functions. The underscore versions require \mathit{lenA} \ge \mathit{lenB} > 0 and do not allow aliasing.
Guides#
The FLINT team, “_fmpz_mod_poly_gcd_euclidean_f, fmpz_mod_poly_gcd_euclidean_f, _fmpz_mod_poly_gcd_f, fmpz_mod_poly_gcd_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_gcd_euclidean_f.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-gcd-euclidean-f,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_gcd\_euclidean\_f, fmpz\_mod\_poly\_gcd\_euclidean\_f, \_fmpz\_mod\_poly\_gcd\_f, fmpz\_mod\_poly\_gcd\_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_gcd_euclidean_f.html},
note = {Generated 2026-10-20}
}