_nmod_poly_gcd_euclidean_redc_fast, nmod_poly_gcd_euclidean_redc_fast
Synopsis
#include <flint/nmod_poly.h>slong _nmod_poly_gcd_euclidean_redc_fast(nn_ptr G, nn_srcptr A, slong lenA, nn_srcptr B, slong lenB, nmod_t mod)sourcevoid nmod_poly_gcd_euclidean_redc_fast(nmod_poly_t G, const nmod_poly_t A, const nmod_poly_t B)sourceThe Euclidean algorithm in Montgomery arithmetic (nmod_redc_fast, see nmod.h), after a first remainder in the ordinary representation. Require an odd prime modulus n < 2^{\mathtt{FLINT\_BITS} - 2}, which is not checked.
Cite this page
The FLINT team, “_nmod_poly_gcd_euclidean_redc_fast, nmod_poly_gcd_euclidean_redc_fast (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_redc_fast.html (generated 2026-10-20).
@misc{flint-doc-nmod-poly-nmod-poly-gcd-euclidean-redc-fast,
author = {{The FLINT team}},
title = {{\_nmod\_poly\_gcd\_euclidean\_redc\_fast, nmod\_poly\_gcd\_euclidean\_redc\_fast (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_redc_fast.html},
note = {Generated 2026-10-20}
}