bernoulli_rev_init
Synopsis
#include <flint/bernoulli.h>void bernoulli_rev_init(bernoulli_rev_t iter, ulong n)sourceInitialises iter so that the first call to bernoulli_rev_next returns . An odd is replaced by . Throws if BERNOULLI_REV_NMAX. The table is built on the threads available, without temporaries beyond itself, and takes about bits of memory for the current index (5 GB for ), or about of that from , where the powers of the divisible by 3 or 5 are left out (see The reverse iterator), being given back as the iteration proceeds; each thread working in it adds some 60 numbers of the size of .
Cite this page
The FLINT team, “bernoulli_rev_init (bernoulli.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/bernoulli/bernoulli_rev_init.html (generated 2026-11-20).
@misc{flint-doc-bernoulli-bernoulli-rev-init,
author = {{The FLINT team}},
title = {{bernoulli\_rev\_init (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_init.html},
note = {Generated 2026-11-20}
}