fmpz_mod_ctx_init_rand_bits, fmpz_mod_ctx_init_rand_bits_prime
Synopsis
#include <flint/fmpz_mod.h>void fmpz_mod_ctx_init_rand_bits(fmpz_mod_ctx_t ctx, flint_rand_t state, flint_bitcnt_t max_bits)sourcevoid fmpz_mod_ctx_init_rand_bits_prime(fmpz_mod_ctx_t ctx, flint_rand_t state, flint_bitcnt_t max_bits)sourceInitialise ctx with a random modulus, for testing: 2 + m with m a random integer of at most max_bits bits (from fmpz_randtest_unsigned), respectively the least probable prime (fmpz_nextprime without proof) greater than such an m. The modulus can have slightly more than max_bits bits.
Cite this page
The FLINT team, “fmpz_mod_ctx_init_rand_bits, fmpz_mod_ctx_init_rand_bits_prime (fmpz_mod.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod/fmpz_mod_ctx_init_rand_bits.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-fmpz-mod-ctx-init-rand-bits,
author = {{The FLINT team}},
title = {{fmpz\_mod\_ctx\_init\_rand\_bits, fmpz\_mod\_ctx\_init\_rand\_bits\_prime (fmpz\_mod.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod/fmpz_mod_ctx_init_rand_bits.html},
note = {Generated 2026-10-20}
}