jaxpolylog.polylogs._zeta_pos_int# _zeta_pos_int(n: int) → float[source]# Riemann ζ(n) for integer n ≥ 2, fp64-precise. Even n: closed form ζ(2m) = |B_{2m}| (2π)^{2m} / (2 · (2m)!) from the exact Bernoulli table. Odd n: direct summation plus a five-term Euler–Maclaurin tail (more than enough for fp64 from K=60 onward).