NMOD_POLY_GCD_EUCLIDEAN_USE_REDC_FAST
Synopsis
#include <flint/nmod_poly.h>NMOD_POLY_GCD_EUCLIDEAN_USE_REDC_FAST(lenB, mod)sourceThe condition under which _nmod_poly_gcd and _nmod_poly_resultant use the Montgomery version of the Euclidean algorithm: \mathit{lenB} \ge 32 and \mathtt{FLINT\_BITS}/2 \le NMOD_BITS(mod) \le \mathtt{FLINT\_BITS} - 2. It does not check that n is odd, so an even modulus in this range gives an exception or a crash; such moduli are not prime and therefore not supported anyway.
Cite this page
The FLINT team, “NMOD_POLY_GCD_EUCLIDEAN_USE_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_USE_REDC_FAST.html (generated 2026-10-20).
@misc{flint-doc-nmod-poly-NMOD-POLY-GCD-EUCLIDEAN-USE-REDC-FAST,
author = {{The FLINT team}},
title = {{NMOD\_POLY\_GCD\_EUCLIDEAN\_USE\_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_USE_REDC_FAST.html},
note = {Generated 2026-10-20}
}