Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.08245

Fast Ramanujan-type Series for Logarithms. Part I

Jorge Zuniga
View original source ↗Read source document ↗Export metadata ↓

Abstract

This report introduces new series and variations of some hypergeometric type identities for fast computing of logarithms $\log\,p$ for small positive integers $p$. 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 $_4F_3$ 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.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jorge Zuniga. 2025-06-09. Fast Ramanujan-type Series for Logarithms. Part I. https://arxiv.org/abs/2506.08245

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT↗
arXiv2026

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT↗