_fq_nmod_poly_gcd_euclidean_f, fq_nmod_poly_gcd_euclidean_f
Synopsis
#include <flint/fq_nmod_poly.h>slong _fq_nmod_poly_gcd_euclidean_f(fq_nmod_t f, fq_nmod_struct * G, const fq_nmod_struct * A, slong lenA, const fq_nmod_struct * B, slong lenB, const fq_nmod_ctx_t ctx)void fq_nmod_poly_gcd_euclidean_f(fq_nmod_t f, fq_nmod_poly_t G, const fq_nmod_poly_t A, const fq_nmod_poly_t B, const fq_nmod_ctx_t ctx)GCD by the Euclidean algorithm for a possibly reducible defining polynomial: either set f = 1 and G to the GCD (monic in the non-underscore version) and return its length, or set f to a nontrivial factor of the defining polynomial when a leading coefficient is not invertible, leaving G undefined. The underscore version requires lenA \ge lenB > 0 and space for lenB coefficients.
Generated from the same template as _fq_poly_gcd_euclidean_f, whose documentation has the details.
Cite this page
The FLINT team, “_fq_nmod_poly_gcd_euclidean_f, fq_nmod_poly_gcd_euclidean_f (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_gcd_euclidean_f.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-gcd-euclidean-f,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_gcd\_euclidean\_f, fq\_nmod\_poly\_gcd\_euclidean\_f (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_gcd_euclidean_f.html},
note = {Generated 2026-10-20}
}