fmpz_poly_randtest_irreducible1, fmpz_poly_randtest_irreducible2, fmpz_poly_randtest_irreducible
Synopsis
#include <flint/fmpz_poly.h>void fmpz_poly_randtest_irreducible1(fmpz_poly_t pol, flint_rand_t state, slong len, flint_bitcnt_t bits)sourcevoid fmpz_poly_randtest_irreducible2(fmpz_poly_t pol, flint_rand_t state, slong len, flint_bitcnt_t bits)sourcevoid fmpz_poly_randtest_irreducible(fmpz_poly_t pol, flint_rand_t state, slong len, flint_bitcnt_t bits)sourceSet pol to a random polynomial of length at most len with coefficients of at most bits bits that is irreducible over \mathbb{Z}. irreducible1 lifts a random irreducible polynomial modulo a random prime to \mathbb{Z} (an irreducible image modulo a prime that does not divide the leading coefficient proves irreducibility); irreducible2 factors a random polynomial and returns a random factor; the third function chooses one of the two at random.
Cite this page
The FLINT team, “fmpz_poly_randtest_irreducible1, fmpz_poly_randtest_irreducible2, fmpz_poly_randtest_irreducible (fmpz_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly/fmpz_poly_randtest_irreducible1.html (generated 2026-10-20).
@misc{flint-doc-fmpz-poly-fmpz-poly-randtest-irreducible1,
author = {{The FLINT team}},
title = {{fmpz\_poly\_randtest\_irreducible1, fmpz\_poly\_randtest\_irreducible2, fmpz\_poly\_randtest\_irreducible (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_randtest_irreducible1.html},
note = {Generated 2026-10-20}
}