`_fq_nmod_poly_xgcd`

Synopsis#include <flint/fq_nmod_poly.h>

slong _fq_nmod_poly_xgcd(fq_nmod_struct * G, fq_nmod_struct * S, fq_nmod_struct * fq_nmod, const fq_nmod_struct * A, slong lenA, const fq_nmod_struct * B, slong lenB, const fq_nmod_ctx_t ctx)

Computes a GCD $G$ of $A$ and $B$ and cofactors $S$ , $T$ (the argument named fq_nmod) 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.

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-11-02).

@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-11-02}
}

Edit this page · PDF version · Built with fdoc from 0a4634bf95