_fq_poly_xgcd
Synopsis
#include <flint/fq_poly.h>slong _fq_poly_xgcd(fq_struct * G, fq_struct * S, fq_struct * fq, const fq_struct * A, slong lenA, const fq_struct * B, slong lenB, const fq_ctx_t ctx)Computes a GCD G of A and B and cofactors S, T (the argument named fq) with SA + TB = G, and returns the length of G. Requires lenA \ge lenB \ge 1 and (\mathit{lenA}, \mathit{lenB}) \ne (1, 1), space for lenB coefficients in G, lenB - 1 in S and lenA - 1 in T, and no aliasing. G is not made monic. This is a wrapper of _gr_poly_xgcd_euclidean and _gr_poly_xgcd_hgcd.
Cite this page
The FLINT team, “_fq_poly_xgcd (fq_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_poly/_fq_poly_xgcd.html (generated 2026-10-20).
@misc{flint-doc-fq-poly-fq-poly-xgcd,
author = {{The FLINT team}},
title = {{\_fq\_poly\_xgcd (fq\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_poly/_fq_poly_xgcd.html},
note = {Generated 2026-10-20}
}