fmpz_mpoly_randtest_bound, fmpz_mpoly_randtest_bounds, fmpz_mpoly_randtest_bits
Synopsis
#include <flint/fmpz_mpoly.h>void fmpz_mpoly_randtest_bound(fmpz_mpoly_t A, flint_rand_t state, slong length, flint_bitcnt_t coeff_bits, ulong exp_bound, const fmpz_mpoly_ctx_t ctx)sourcevoid fmpz_mpoly_randtest_bounds(fmpz_mpoly_t A, flint_rand_t state, slong length, flint_bitcnt_t coeff_bits, ulong * exp_bounds, const fmpz_mpoly_ctx_t ctx)sourcevoid fmpz_mpoly_randtest_bits(fmpz_mpoly_t A, flint_rand_t state, slong length, flint_bitcnt_t coeff_bits, flint_bitcnt_t exp_bits, const fmpz_mpoly_ctx_t ctx)sourceSet A to a random polynomial with at most length terms (fewer after like terms are combined), coefficients of about coeff_bits bits (as from fmpz_randtest), and exponents in [0, \mathit{exp\_bound}), in [0, \mathit{exp\_bounds}[i]) for the variable of index i, or such that the monomials can be packed into exp_bits bits. Intended for testing.
Cite this page
The FLINT team, “fmpz_mpoly_randtest_bound, fmpz_mpoly_randtest_bounds, fmpz_mpoly_randtest_bits (fmpz_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mpoly/fmpz_mpoly_randtest_bound.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mpoly-fmpz-mpoly-randtest-bound,
author = {{The FLINT team}},
title = {{fmpz\_mpoly\_randtest\_bound, fmpz\_mpoly\_randtest\_bounds, fmpz\_mpoly\_randtest\_bits (fmpz\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mpoly/fmpz_mpoly_randtest_bound.html},
note = {Generated 2026-10-20}
}