_nmod_poly_gcd_euclidean, nmod_poly_gcd_euclidean
Synopsis
#include <flint/nmod_poly.h>slong _nmod_poly_gcd_euclidean(nn_ptr G, nn_srcptr A, slong lenA, nn_srcptr B, slong lenB, nmod_t mod)sourcevoid nmod_poly_gcd_euclidean(nmod_poly_t G, const nmod_poly_t A, const nmod_poly_t B)sourceThe GCD by the Euclidean algorithm, with the conventions of _nmod_poly_gcd and nmod_poly_gcd. Each step is a call to _nmod_poly_rem, so the cost is O(\mathit{lenA} \cdot \mathit{lenB}).
Cite this page
The FLINT team, “_nmod_poly_gcd_euclidean, nmod_poly_gcd_euclidean (nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_poly/_nmod_poly_gcd_euclidean.html (generated 2026-10-20).
@misc{flint-doc-nmod-poly-nmod-poly-gcd-euclidean,
author = {{The FLINT team}},
title = {{\_nmod\_poly\_gcd\_euclidean, nmod\_poly\_gcd\_euclidean (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_gcd_euclidean.html},
note = {Generated 2026-10-20}
}