`_fmpz_poly_product_roots_fmpq_vec, fmpz_poly_product_roots_fmpq_vec`

Synopsis#include <flint/fmpz_poly.h>

void _fmpz_poly_product_roots_fmpq_vec(fmpz * poly, const fmpq * xs, slong n)source

void fmpz_poly_product_roots_fmpq_vec(fmpz_poly_t poly, const fmpq * xs, slong n)source

Set poly to $(q_0 x - p_0) \cdots (q_{n-1} x - p_{n-1})$ for the rational numbers $x_i = p_i / q_i$ in xs, the primitive polynomial in $\mathbb{Z}[x]$ with roots $x_i$ when they are given in lowest terms. The underscore version writes $n + 1$ coefficients.

Cite this page

The FLINT team, “_fmpz_poly_product_roots_fmpq_vec, fmpz_poly_product_roots_fmpq_vec (fmpz_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly/_fmpz_poly_product_roots_fmpq_vec.html (generated 2026-11-02).

@misc{flint-doc-fmpz-poly-fmpz-poly-product-roots-fmpq-vec,
  author       = {{The FLINT team}},
  title        = {{\_fmpz\_poly\_product\_roots\_fmpq\_vec, fmpz\_poly\_product\_roots\_fmpq\_vec (fmpz\_poly.h)}},
  howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
  year         = {2026},
  url          = {https://flintlib.org/doc/fmpz_poly/_fmpz_poly_product_roots_fmpq_vec.html},
  note         = {Generated 2026-11-02}
}

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