`_fmpq_poly_gcd`

Synopsis#include <flint/fmpq_poly.h>

void _fmpq_poly_gcd(fmpz * G, fmpz_t denG, const fmpz * A, slong lenA, const fmpz * B, slong lenB)source

Computes the monic greatest common divisor $G$ of $A$ and $B$ .

Assumes that $G$ has space for $\operatorname{len}(B)$ coefficients, where $\operatorname{len}(A) \geq \operatorname{len}(B) > 0$ .

Aliasing between the output and input arguments is not supported.

Does not support zero-padding.

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-11-02).

@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-11-02}
}

Edit this page · PDF version · Built with fdoc from 0a4634bf95