bernoulli_cache_compute
Synopsis
#include <flint/bernoulli.h>Makes sure that B_0, \ldots, B_{n-1} are cached. The cache grows by at least 32 entries (below 128) or 128 entries at a time; new entries are computed with arith_bernoulli_number_vec up to 128 and with bernoulli_fmpq_vec_no_cache beyond.
Cite this page
The FLINT team, “bernoulli_cache_compute (bernoulli.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/bernoulli/bernoulli_cache_compute.html (generated 2026-10-20).
@misc{flint-doc-bernoulli-bernoulli-cache-compute,
author = {{The FLINT team}},
title = {{bernoulli\_cache\_compute (bernoulli.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/bernoulli/bernoulli_cache_compute.html},
note = {Generated 2026-10-20}
}