bernoulli_fmpq_vec_no_cache
#include <flint/bernoulli.h>Sets res to the num consecutive Bernoulli numbers B_a, B_{a+1}, \ldots, B_{a + \mathit{num} - 1}, without reading or writing the cache. To reuse a vector, use bernoulli_cache_compute and bernoulli_fmpq_ui instead. Throws if a > 2^{31} or \mathit{num} > 10^9.
For a = 0 and \mathit{num} \le 128 the function calls arith_bernoulli_number_vec. Otherwise it runs reverse iterators over blocks of indices; for \mathit{num} \ge 200 the blocks (of size about (a + \mathit{num})/32, at least 128) are distributed over the threads of flint_set_num_threads. The function is not optimised for small num at large a, where each block costs about as much as B_{a + \mathit{num}} alone.
The FLINT team, “bernoulli_fmpq_vec_no_cache (bernoulli.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/bernoulli/bernoulli_fmpq_vec_no_cache.html (generated 2026-10-20).
@misc{flint-doc-bernoulli-bernoulli-fmpq-vec-no-cache,
author = {{The FLINT team}},
title = {{bernoulli\_fmpq\_vec\_no\_cache (bernoulli.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/bernoulli/bernoulli_fmpq_vec_no_cache.html},
note = {Generated 2026-10-20}
}