相关论文: Madhava's Pi-Series in the Modern Context

We have rediscovered a simple algorithm to compute the mathematical constant \[ \pi=3.14159265\cdots. \] The algorithm had been known for a long time but it might not be recognized as a fast, practical algorithm. The time complexity of it…

In 1914 S. Ramanujan recorded a list of 17 series for $1/\pi$. We survey the methods of proofs of Ramanujan's formulae and indicate recently discovered generalizations, some of which are not yet proven.

This paper is a tribute to the genius of the legendary Indian mathematician Srinivasa Ramanujan (22 December 1887 - 26 April 1920) in the centenary year of his death. The life story of Ramanujan is so well known that it needs no elaboration…

In a well-known 1914 paper, Ramanujan gave a number of rapidly converging series for $1/\pi$ which are derived using modular functions of higher level. D. V. and G. V. Chudnovsky in their 1988 paper derived an analogous series representing…

In this work, we develop a new iterative method for computing the digits of $\pi$ by argument reduction of the tangent function. This method combines a modified version of the iterative formula for $\pi$ with squared convergence that we…

The numerical phenomenon of $\pi$ appearing at parameters $c = 1/4$, $c=-3/4$ and $c=-5/4$ in the Mandelbrot set $\mathcal{M}$ has been known for over 30 years. In 2001, the first proof was provided by Aaron Klebanoff for the parameter…

We prove that given $\lambda \in \mathbb{R}$ such that $0 < \lambda < 1$, then $\pi(x + x^\lambda) - \pi(x) \sim \displaystyle \frac{x^\lambda}{\log(x)}$. This solves a long-standing problem concerning the existence of primes in short…

Via symbolic computation we deduce 97 new type series for powers of $\pi$ related to Ramanujan-type series. Here are three typical examples: $$\sum_{k=0}^\infty \frac{P(k) \binom{2k}k\binom{3k}k…

This paper presents a detailed, self-contained proof of a BBP-type formula for $\pi^2$ expressed in the golden ratio base, $\phi$. The formula was discovered empirically by the author in 2004. The proof presented herein is built upon a…

In this work, we consider the properties of the two-term Machin-like formula and develop an algorithm for computing digits of $\pi$ by using its rational approximation. In this approximation, both terms are constructed by using a…

The second Hardy-Littlewood conjecture, that $\pi(x)+\pi(y) \geq \pi(x+y)$ for integers $x$ and $y$ with $\min\{x,y\}\geq 2$, was formulated in 1923. It continues to attract attention to this day, almost 100 years later. In 1975 Udrescu…

Using an infinite family of generalizations of the Chudnovsky brothers' series recently obtained via the analytic continuation of the Borwein brothers' formula for Ramanujan-type series of level 1, we apply the Gauss-Salamin-Brent iteration…

We prove a sharp Lieb-Thirring type inequality for Jacobi matrices, thereby settling a conjecture of Hundertmark and Simon. An interesting feature of the proof is that it employs a technique originally used by Hundertmark-Laptev-Weidl…

In 1987 Jonathan and Peter Borwein, inspired by the works of Ramanujan, derived many efficient algorithms for computing $\pi$. We will see that by using only a formula of Gauss's and elementary algebra we are able to prove the correctness…

In 1996 Goulden and Jackson introduced a family of coefficients $( c_{\pi, \sigma}^{\lambda} ) $ indexed by triples of partitions which arise in the power sum expansion of some Cauchy sum for Jack symmetric functions $( J^{(\alpha )}_\pi…

This paper examines how the mathematicians and astronomers of the Kerala school tackled the problem of computing the values of the arcsin function. Four different approaches are discussed all of which are found in Nilakantha Somayaji's…

Transcription into modern notations of the derivation by Stirling and De Moivre of an asymptotic series for $\log(n!)$, usually called Stirling's series. The previous discovery by Wallis of an infinite product for $\pi$, and later results…

Approximate relations between $e$ and $\pi$ are reviewed, some new connections being established. Nilakantha's series expansion for $\pi$ is transformed to accelerate its convergence. Its comparison with the standard inverse-factorial…

There is not much that can be said for all $x$ and for all $n$ about the sum \[ \sum_{k=1}^n \frac{1}{|\sin k\pi x|}. \] However, for this and similar sums, series, and products, we can establish results for almost all $x$ using the tools…

This work derives 5 methods to evaluate families of odd zeta values by combining a power of $\pi$ with Lambert series whose ratios of successive terms tend to $e^{-\pi\sqrt{a}}$ with integers $a\ge7$, outperforming Ramanujan's results with…