arith_bernoulli_number_vec, _arith_bernoulli_number_vec
Synopsis
#include <flint/arith.h>Set the entries to B_0, B_1, \ldots, B_{n-1}. For n < 700 the function calls _arith_bernoulli_number_vec_recursive, otherwise _arith_bernoulli_number_vec_multi_mod. For long vectors, bernoulli_fmpq_vec_no_cache (which uses the zeta function and several threads) is usually faster.
Cite this page
The FLINT team, “arith_bernoulli_number_vec, _arith_bernoulli_number_vec (arith.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/arith/arith_bernoulli_number_vec.html (generated 2026-10-20).
@misc{flint-doc-arith-arith-bernoulli-number-vec,
author = {{The FLINT team}},
title = {{arith\_bernoulli\_number\_vec, \_arith\_bernoulli\_number\_vec (arith.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/arith/arith_bernoulli_number_vec.html},
note = {Generated 2026-10-20}
}