bernoulli_rev_t
Synopsis
#include <flint/bernoulli.h>bernoulli_rev_tAn iterator that generates the even-indexed Bernoulli numbers in decreasing order, without caching. An array of length one of bernoulli_rev_struct.
The numbers are computed from the zeta series summed directly in fixed-point arithmetic, with a table of the odd powers that is updated by multiplication by when decreases by 2 [Blo2009]. The reverse order is what makes the updates multiplications rather than divisions, and lets the precision and the number of terms decrease as decreases. See The zeta function method.
References#
- [Blo2009] R. Bloemen, "Even faster zeta(2n) calculation!", https://web.archive.org/web/20141101133659/http://xn--2-umb.com/09/11/even-faster-zeta-calculation
Cite this page
The FLINT team, “bernoulli_rev_t (bernoulli.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/bernoulli/bernoulli_rev_t.html (generated 2026-11-02).
@misc{flint-doc-bernoulli-bernoulli-rev-t,
author = {{The FLINT team}},
title = {{bernoulli\_rev\_t (bernoulli.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/bernoulli/bernoulli_rev_t.html},
note = {Generated 2026-11-02}
}