n_fq_poly_gcd_, n_fq_poly_gcd, n_fq_poly_xgcd
Synopsis
#include <flint/n_poly.h>void n_fq_poly_gcd_(n_poly_t G, const n_poly_t A, const n_poly_t B, const fq_nmod_ctx_t ctx, n_poly_stack_t St)sourcevoid n_fq_poly_gcd(n_poly_t G, const n_poly_t A, const n_poly_t B, const fq_nmod_ctx_t ctx)sourcevoid n_fq_poly_xgcd(n_poly_t G, n_poly_t S, n_poly_t T, const n_poly_t B, const n_poly_t C, const fq_nmod_ctx_t ctx)sourceMonic greatest common divisor by the Euclidean algorithm, and for n_fq_poly_xgcd cofactors S, T with SB + TC = G.
Cite this page
The FLINT team, “n_fq_poly_gcd_, n_fq_poly_gcd, n_fq_poly_xgcd (n_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/n_poly/n_fq_poly_gcd_.html (generated 2026-10-20).
@misc{flint-doc-n-poly-n-fq-poly-gcd,
author = {{The FLINT team}},
title = {{n\_fq\_poly\_gcd\_, n\_fq\_poly\_gcd, n\_fq\_poly\_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_fq_poly_gcd_.html},
note = {Generated 2026-10-20}
}