_fmpz_mod_mpoly_gcd_algo
Synopsis
#include <flint/fmpz_mod_mpoly_factor.h>int _fmpz_mod_mpoly_gcd_algo(fmpz_mod_mpoly_t G, fmpz_mod_mpoly_t Abar, fmpz_mod_mpoly_t Bbar, const fmpz_mod_mpoly_t A, const fmpz_mod_mpoly_t B, const fmpz_mod_mpoly_ctx_t ctx, unsigned int algo)sourceComputes the GCD G and, if Abar and Bbar are not NULL, the cofactors of the nonzero A and B with the algorithms in the bit mask algo (MPOLY_GCD_USE_BROWN, MPOLY_GCD_USE_HENSEL, MPOLY_GCD_USE_ZIPPEL, MPOLY_GCD_USE_ZIPPEL2, MPOLY_GCD_USE_PRS or MPOLY_GCD_USE_ALL). For a word-size modulus it calls _nmod_mpoly_gcd_algo_small. Returns 1 for success.
Cite this page
The FLINT team, “_fmpz_mod_mpoly_gcd_algo (fmpz_mod_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_mpoly_factor/_fmpz_mod_mpoly_gcd_algo.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-mpoly-factor-fmpz-mod-mpoly-gcd-algo,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_mpoly\_gcd\_algo (fmpz\_mod\_mpoly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_mpoly_factor/_fmpz_mod_mpoly_gcd_algo.html},
note = {Generated 2026-10-20}
}