FLINT3.7.0-dev
/

fmpz_mpoly_q_add, fmpz_mpoly_q_add_fmpq, fmpz_mpoly_q_add_fmpz, fmpz_mpoly_q_add_si, fmpz_mpoly_q_sub, fmpz_mpoly_q_sub_fmpq, fmpz_mpoly_q_sub_fmpz, fmpz_mpoly_q_sub_si

Synopsis#include <flint/fmpz_mpoly_q.h>
void fmpz_mpoly_q_add(fmpz_mpoly_q_t res, const fmpz_mpoly_q_t x, const fmpz_mpoly_q_t y, const fmpz_mpoly_ctx_t ctx)source
void fmpz_mpoly_q_add_fmpq(fmpz_mpoly_q_t res, const fmpz_mpoly_q_t x, const fmpq_t y, const fmpz_mpoly_ctx_t ctx)source
void fmpz_mpoly_q_add_fmpz(fmpz_mpoly_q_t res, const fmpz_mpoly_q_t x, const fmpz_t y, const fmpz_mpoly_ctx_t ctx)source
void fmpz_mpoly_q_add_si(fmpz_mpoly_q_t res, const fmpz_mpoly_q_t x, slong y, const fmpz_mpoly_ctx_t ctx)source
void fmpz_mpoly_q_sub(fmpz_mpoly_q_t res, const fmpz_mpoly_q_t x, const fmpz_mpoly_q_t y, const fmpz_mpoly_ctx_t ctx)source
void fmpz_mpoly_q_sub_fmpq(fmpz_mpoly_q_t res, const fmpz_mpoly_q_t x, const fmpq_t y, const fmpz_mpoly_ctx_t ctx)source
void fmpz_mpoly_q_sub_fmpz(fmpz_mpoly_q_t res, const fmpz_mpoly_q_t x, const fmpz_t y, const fmpz_mpoly_ctx_t ctx)source
void fmpz_mpoly_q_sub_si(fmpz_mpoly_q_t res, const fmpz_mpoly_q_t x, slong y, const fmpz_mpoly_ctx_t ctx)source

Set res to x+yx + y, respectively x−yx - y. The sum a/b+c/da/b + c/d is formed as in the classical algorithm for fractions: with g=gcd⁡(b,d)g = \gcd(b, d), the numerator a(d/g)+c(b/g)a (d/g) + c (b/g) only needs to be reduced by its GCD with gg.

Cite this page

The FLINT team, “fmpz_mpoly_q_add, fmpz_mpoly_q_add_fmpq, fmpz_mpoly_q_add_fmpz, fmpz_mpoly_q_add_si, fmpz_mpoly_q_sub, fmpz_mpoly_q_sub_fmpq, fmpz_mpoly_q_sub_fmpz, fmpz_mpoly_q_sub_si (fmpz_mpoly_q.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mpoly_q/fmpz_mpoly_q_add.html (generated 2026-11-02).