fmpq_poly_gcd
Synopsis
#include <flint/fmpq_poly.h>void fmpq_poly_gcd(fmpq_poly_t G, const fmpq_poly_t A, const fmpq_poly_t B)sourceComputes the monic greatest common divisor G of A and B.
In the special case when A = B = 0, sets G = 0.
Guides#
Cite this page
The FLINT team, “fmpq_poly_gcd (fmpq_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpq_poly/fmpq_poly_gcd.html (generated 2026-10-20).
@misc{flint-doc-fmpq-poly-fmpq-poly-gcd,
author = {{The FLINT team}},
title = {{fmpq\_poly\_gcd (fmpq\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpq_poly/fmpq_poly_gcd.html},
note = {Generated 2026-10-20}
}