_nmod_poly_xgcd_euclidean, nmod_poly_xgcd_euclidean, _nmod_poly_xgcd_hgcd, nmod_poly_xgcd_hgcd
Synopsis
#include <flint/nmod_poly.h>slong _nmod_poly_xgcd_euclidean(nn_ptr res, nn_ptr s, nn_ptr t, nn_srcptr poly1, slong len1, nn_srcptr poly2, slong len2, nmod_t mod)sourcevoid nmod_poly_xgcd_euclidean(nmod_poly_t G, nmod_poly_t S, nmod_poly_t T, const nmod_poly_t A, const nmod_poly_t B)sourceslong _nmod_poly_xgcd_hgcd(nn_ptr G, nn_ptr S, nn_ptr T, nn_srcptr A, slong lenA, nn_srcptr B, slong lenB, nmod_t mod)sourcevoid nmod_poly_xgcd_hgcd(nmod_poly_t G, nmod_poly_t S, nmod_poly_t T, const nmod_poly_t A, const nmod_poly_t B)sourceThe extended GCD by the Euclidean and by the half-GCD algorithm, with the conventions of _nmod_poly_xgcd and nmod_poly_xgcd.
Cite this page
The FLINT team, “_nmod_poly_xgcd_euclidean, nmod_poly_xgcd_euclidean, _nmod_poly_xgcd_hgcd, nmod_poly_xgcd_hgcd (nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_poly/_nmod_poly_xgcd_euclidean.html (generated 2026-10-20).
@misc{flint-doc-nmod-poly-nmod-poly-xgcd-euclidean,
author = {{The FLINT team}},
title = {{\_nmod\_poly\_xgcd\_euclidean, nmod\_poly\_xgcd\_euclidean, \_nmod\_poly\_xgcd\_hgcd, nmod\_poly\_xgcd\_hgcd (nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod_poly/_nmod_poly_xgcd_euclidean.html},
note = {Generated 2026-10-20}
}