FLINT3.7.0-dev
/

arb_bernoulli_ui_zeta

Synopsis#include <flint/arb.h>
void arb_bernoulli_ui_zeta(arb_t b, ulong n, slong prec)source

Sets b to BnB_n using B2n=(−1)n+12(2n)! ζ(2n)/(2π)2nB_{2n} = (-1)^{n+1} 2 (2n)!\, \zeta(2n) / (2\pi)^{2n}, with ζ\zeta evaluated by the Euler product. This is accurate only if prec is small enough compared to nn for the product to converge quickly.

Cite this page

The FLINT team, “arb_bernoulli_ui_zeta (arb.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/arb/arb_bernoulli_ui_zeta.html (generated 2026-11-02).