zassenhaus_prune_must_be_irreducible
Synopsis
#include <flint/fmpz_poly_factor.h>int zassenhaus_prune_must_be_irreducible(const zassenhaus_prune_t Z)sourceReturns whether no degree strictly between 0 and the degree of the polynomial is possible, which proves the polynomial irreducible.
Cite this page
The FLINT team, “zassenhaus_prune_must_be_irreducible (fmpz_poly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly_factor/zassenhaus_prune_must_be_irreducible.html (generated 2026-10-20).
@misc{flint-doc-fmpz-poly-factor-zassenhaus-prune-must-be-irreducible,
author = {{The FLINT team}},
title = {{zassenhaus\_prune\_must\_be\_irreducible (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/zassenhaus_prune_must_be_irreducible.html},
note = {Generated 2026-10-20}
}