Fast Ramanujan-type Series for Logarithms. Part I
Abstract
This report introduces new series and variations of some hypergeometric type identities for fast computing of logarithms for small positive integers . These series were found using Wilf Zeilberger (WZ) method and/or integer detection algorithms (LLL) providing highly efficient linearly convergent rational approximants for these constants. Some of the new identities are of type, but higher ones are found as well and hypergeometric series for log p, with variable p, have been derived. Found identities are proven by I. classical Beta Integral methods, II. some hypergometric closed forms and III. rational certificates from the WZ method. Since they are very fast, these series are particularly suitable to be embodied in mathematical software being implemented in binary splitting form which produces very efficient algorithms. Over 10e12 decimal places have been obtained for some logarithms in reasonable time.
Cite
@article{arxiv.2506.08245,
title = {Fast Ramanujan-type Series for Logarithms. Part I},
author = {Jorge Zuniga},
journal= {arXiv preprint arXiv:2506.08245},
year = {2025}
}
Comments
18 pages. PARI GP program is embedded in accompanying TeX file which must be downloaded, code extracted and saved as a GP script file