On the Rapid Computation of Various Polylogarithmic Constants

Abstract

We give algorithms for the computation of the d-th digit of certain transcendental numbers in various bases. These algorithms can be easily implemented (multiple precision arithmetic is not needed), require virtually no memory, and feature run times that scale nearly linearly with the order of the digit desired. They make it feasible to compute, for example, the billionth binary digit of log(2) or _ on a modest workstation in a few hours run time.We demonstrate this technique by computing the ten billionth hexadecimal digit of it, the billionth hexadecimal digits of _'_, log(2) and log2(2), and the ten billionth decimal digit of log(9/10).These calculations rest on the observation that very special types of identities exist for certain numbers like n, it 2, log(2) and 1og2(2). These are essentially polylogarithmic ladders in an integer base. A number of these identities that we derive in this work appear to be new, for example the critical identity for 7z:

Double integrals and infinite products for some classical constants via analytic continuations of Lerch’s transcendent

“…Example 3.7 In Bailey, Borwein, and Plouffe's [1] dilogarithm "ladder" (2), we replace Li 2 (1/2 k ) with a double integral in which we substitute x, y → x k , y k , for k = 1, 2, 3, and 6, obtaining…”

Error estimates of Ramanujan-type series

“…see also [5]. The second series in (3.2) is obtained from the previous by coupling two consecutive terms.…”

“…Since the publication of [5], other authors have presented similar formulas now known as BBP-type series. Chan [7] proposed the series…”

The Two Quadrillionth Bit of Pi is 0! Distributed Computation of Pi with Apache Hadoop

“…Any BBP-type formula, such as equation (1) or equation (2), can be used 14 Bit Position 100,000,000,000,001 …”