Search arXivSearch

arXiv · 2108.00844

Asymptotic expansions for the truncation error in Ramanujan-type series

Abstract

Many of the fastest known algorithms to compute $π$ involve generalized hypergeometric series, such as the Ramanujan-Sato series. In this paper, we investigate the rates of convergence for several such series and we give asymptotic expansions for the error of finite approximation. For example, when using the first $n$ terms of the Chudnovskys' series, we obtain the finite approximation $π_n\approx π$. It is known that the truncation error satisfies $|π_n-π|\approx 53360^{-3n}.$ In this paper, we prove that the asymptotic expansion for the truncation error in the Chudnovskys' series is $$\left|π_n-π\right|=53360^{-3n}\cdot\frac{{106720}\sqrt{{10005}π}}{{1672209}\sqrt{n}}\cdot\exp\left(\frac{A_1}{n}+\frac{A_2}{n^2}+\frac{δ_n}{n^3}\right),$$ with ${0.006907}<δ_n<{0.008429}$ and the exact rational values of $A_1$ and $A_2$: $$A_1= -\frac{1781843197433}{7456754505816},$$ $$A_2= -\frac{1080096011925710088395}{3475199235000451148614116}.$$ Thus we demonstrate how to establish precise error bounds for the approximations for $π$ obtained through Ramanujan-like series for $1/π$. We also give asymptotic expansions for all known rational hypergeometric series for $1/π$ in the appendix.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lorenz Milla. 2022-05-19. Asymptotic expansions for the truncation error in Ramanujan-type series. https://doi.org/10.1007/s11139-022-00608-x

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

KEEP EXPLORING

Related papers

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

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