_fmpz_mod_poly_product_roots_fmpz_vec, fmpz_mod_poly_product_roots_fmpz_vec
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_product_roots_fmpz_vec(fmpz * poly, const fmpz * xs, slong n, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_product_roots_fmpz_vec(fmpz_mod_poly_t poly, const fmpz * xs, slong n, const fmpz_mod_ctx_t ctx)sourceSet poly to the monic polynomial for reduced , by a quadratic algorithm for and by splitting the roots into halves otherwise. The underscore version writes coefficients and does not allow aliasing.
Cite this page
The FLINT team, “_fmpz_mod_poly_product_roots_fmpz_vec, fmpz_mod_poly_product_roots_fmpz_vec (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_product_roots_fmpz_vec.html (generated 2026-11-02).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-product-roots-fmpz-vec,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_product\_roots\_fmpz\_vec, fmpz\_mod\_poly\_product\_roots\_fmpz\_vec (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_product_roots_fmpz_vec.html},
note = {Generated 2026-11-02}
}