_fmpz_mod_poly_resultant, fmpz_mod_poly_resultant
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_resultant(fmpz_t res, const fmpz * poly1, slong len1, const fmpz * poly2, slong len2, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_resultant(fmpz_t res, const fmpz_mod_poly_t f, const fmpz_mod_poly_t g, const fmpz_mod_ctx_t ctx)sourceSet res to the resultant of the two polynomials (zero if one of them is zero), computed with _gr_poly_resultant, which uses the Euclidean or the half-GCD algorithm. The underscore version requires \mathit{len1} \ge \mathit{len2} > 0. The modulus should be prime; for a composite modulus the function raises an exception if it meets a non-invertible leading coefficient.
Cite this page
The FLINT team, “_fmpz_mod_poly_resultant, fmpz_mod_poly_resultant (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_resultant.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-resultant,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_resultant, fmpz\_mod\_poly\_resultant (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_resultant.html},
note = {Generated 2026-10-20}
}