fmpz_poly_factor_van_hoeij_check_if_solved
#include <flint/fmpz_poly_factor.h>int fmpz_poly_factor_van_hoeij_check_if_solved(fmpz_mat_t M, fmpz_poly_factor_t final_fac, fmpz_poly_factor_t lifted_fac, const fmpz_poly_t f, fmpz_t P, slong exp, fmpz_t lc)sourceChecks whether the reduced lattice basis of van Hoeij's algorithm determines the factorisation: if the first columns of define a partition of the lifted factors (a 0-1 basis), the products of the factors in each part (times lc, reduced modulo , made primitive) are tested as divisors of , first modulo 2 and then over . If all of them divide, the factors are appended to final_fac with multiplicity exp and 1 is returned; otherwise 0 is returned and final_fac is unchanged.
The FLINT team, “fmpz_poly_factor_van_hoeij_check_if_solved (fmpz_poly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly_factor/fmpz_poly_factor_van_hoeij_check_if_solved.html (generated 2026-11-02).
@misc{flint-doc-fmpz-poly-factor-fmpz-poly-factor-van-hoeij-check-if-solved,
author = {{The FLINT team}},
title = {{fmpz\_poly\_factor\_van\_hoeij\_check\_if\_solved (fmpz\_poly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_poly_factor/fmpz_poly_factor_van_hoeij_check_if_solved.html},
note = {Generated 2026-11-02}
}