fmpz_poly_pfrac_precomp
Synopsis
#include <flint/fmpz_mpoly_factor.h>int fmpz_poly_pfrac_precomp(fmpz_poly_struct * c, const fmpz_poly_t A, fmpz_poly_pfrac_t Iv)sourceSolves A / \prod_i b_i = \sum_i c_i / b_i for c_i \in \mathbb{Z}[x] with \deg c_i < \deg b_i for i < r - 1. The solution is computed modulo a power p^k of the prime and checked by exact division; on failure the precision is raised until a Cramer–Hadamard bound on the solution shows that no integer solution exists. Returns 1 if a solution exists and 0 otherwise, so a return value of 0 is a proof.
Cite this page
The FLINT team, “fmpz_poly_pfrac_precomp (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_precomp.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mpoly-factor-fmpz-poly-pfrac-precomp,
author = {{The FLINT team}},
title = {{fmpz\_poly\_pfrac\_precomp (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_precomp.html},
note = {Generated 2026-10-20}
}