fq_nmod_poly_xgcd
Synopsis
#include <flint/fq_nmod_poly.h>void fq_nmod_poly_xgcd(fq_nmod_poly_t G, fq_nmod_poly_t S, fq_nmod_poly_t fq_nmod, const fq_nmod_poly_t A, const fq_nmod_poly_t B, const fq_nmod_ctx_t ctx)Computes the monic GCD G of A and B and cofactors S, T (the argument named fq_nmod) with SA + TB = G, where \deg S < \deg B - \deg G and \deg T < \deg A - \deg G when both are nonzero. The GCD of two zero polynomials is zero, with zero cofactors. G, S and T must be distinct objects.
Generated from the same template as fq_poly_xgcd, whose documentation has the details.
Cite this page
The FLINT team, “fq_nmod_poly_xgcd (fq_nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_poly/fq_nmod_poly_xgcd.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-xgcd,
author = {{The FLINT team}},
title = {{fq\_nmod\_poly\_xgcd (fq\_nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_poly/fq_nmod_poly_xgcd.html},
note = {Generated 2026-10-20}
}