_fmpq_poly_resultant_div, fmpq_poly_resultant_div
Synopsis
#include <flint/fmpq_poly.h>void _fmpq_poly_resultant_div(fmpz_t rnum, fmpz_t rden, const fmpz * poly1, const fmpz_t den1, slong len1, const fmpz * poly2, const fmpz_t den2, slong len2, const fmpz_t divisor, slong nbits)sourcevoid fmpq_poly_resultant_div(fmpq_t r, const fmpq_poly_t f, const fmpq_poly_t g, const fmpz_t divisor, slong nbits)sourceSet the output to the resultant of f and g divided by divisor, assuming that this quotient is an integer of at most nbits bits. The resultant of the numerators is then computed by a multimodular algorithm that needs only enough primes for nbits bits, which is much faster than fmpq_poly_resultant when a good bound is known (for example when computing norms in number fields). A zero divisor gives zero. The underscore version requires \mathit{len1} \ge \mathit{len2} > 0.
Cite this page
The FLINT team, “_fmpq_poly_resultant_div, fmpq_poly_resultant_div (fmpq_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpq_poly/_fmpq_poly_resultant_div.html (generated 2026-10-20).
@misc{flint-doc-fmpq-poly-fmpq-poly-resultant-div,
author = {{The FLINT team}},
title = {{\_fmpq\_poly\_resultant\_div, fmpq\_poly\_resultant\_div (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_resultant_div.html},
note = {Generated 2026-10-20}
}