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:
Abstract. We produce exact cubic analogues of Jacobi's celebrated theta function identity and of the arithmetic-geometric mean iteration of Gauss and Legendre. The iteration in question is al + anh + bl\
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.