fmpz_poly_pfrac_precompute
Synopsis
#include <flint/fmpz_mpoly_factor.h>int fmpz_poly_pfrac_precompute(fmpz_poly_pfrac_t Iv, const fmpz_poly_struct * b, slong r)sourcePrepares Iv for the r \ge 2 nonconstant denominators b_i \in \mathbb{Z}[x]: computes the products b_{i+1} \cdots b_{r-1}, the resultants that bound the size of solutions, a prime p for which the b_i stay coprime modulo p, and the corresponding inverses. Returns 0 if r < 2, some b_i is constant, or two of them are not coprime.
Cite this page
The FLINT team, “fmpz_poly_pfrac_precompute (fmpz_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mpoly_factor/fmpz_poly_pfrac_precompute.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mpoly-factor-fmpz-poly-pfrac-precompute,
author = {{The FLINT team}},
title = {{fmpz\_poly\_pfrac\_precompute (fmpz\_mpoly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mpoly_factor/fmpz_poly_pfrac_precompute.html},
note = {Generated 2026-10-20}
}