fmpz_mod_poly_rand_irreducible
Synopsis
#include <flint/fmpz_mod_poly.h>void fmpz_mod_poly_rand_irreducible(fmpz_mod_poly_t f, flint_rand_t state, slong len, const fmpz_mod_ctx_t ctx)sourceSets f to a random irreducible polynomial of length at most len with uniformly distributed coefficients, by testing random polynomials with fmpz_mod_poly_is_irreducible. Requires \mathit{len} \ge 1 and a prime modulus.
Cite this page
The FLINT team, “fmpz_mod_poly_rand_irreducible (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/fmpz_mod_poly_rand_irreducible.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-rand-irreducible,
author = {{The FLINT team}},
title = {{fmpz\_mod\_poly\_rand\_irreducible (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/fmpz_mod_poly_rand_irreducible.html},
note = {Generated 2026-10-20}
}