Related papers: History of the formulas and algorithms for pi
A family of original formulae for computing number PI and its proof are presented. An algorithm is proposed to validate the results of this new algorithm.
Using techniques from calculus, we combine classical identities for $\pi$, $\operatorname{ln}2$, and harmonic numbers, to arrive at a nice infinite series formula for $\pi/3$ that does not appear to be well known. In addition, we give…
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…
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…
In this work, we obtain an iterative formula that can be used for computing digits of $\pi$ and nested radicals of kind $c_n/\sqrt{2 - c_{n - 1}}$, where $c_0 = 0$ and $c_n = \sqrt{2 + c_{n - 1}}$. We also show how with the help of this…
We describe how to compute very far decimals of $$\pi$$ and how to provide formal guarantees that the decimals we compute are correct. In particular, we report on an experiment where 1 million decimals of $$\pi$$ and the billionth…
An investigation of the comparative efficiency of the different methods in which {\pi} is cal- culated. This thesis will compare and contrast five different methods in calculating {\pi} by first deriving the various proofs to each method…
The mathematical constant pi has recently been computed up to 22,459,157,718,361 decimal and 18,651,926,753,033 hexadecimal digits. As a simple check for the normality of pi, the frequencies of all sequences with length one, two and three…
By employing certain extended classical summation theorems, several surprising \pi and other formulae are displayed.
In this article, I discuss the relationship of mathematics to the physical world, and to other spheres of human knowledge. In particular, I argue that Mathematics is created by human beings, and the number $\pi$ can not be said to have…
This article is about Pi Formulas, infinite series of fractions which sum to multiples of Pi. Each such one can be associated with a unique set $S_k$ of rough numbers, where $k$ is a prime number. Given $S_k$ for any prime $k$, the set…
An algorithm for computing /pi(N) is presented.It is shown that using a symmetry of natural numbers we can easily compute /pi(N).This method relies on the fact that counting the number of odd composites not exceeding N suffices to calculate…
The decimal digits of $\pi$ are widely believed to behave like as statistically independent random variables taking the values $0, 1, 2, 3, 4, 5$, $6, 7, 8, 9$ with equal probabilities $1/10$. In this article, first, another similar…
We exploit transformations relating generalized $q$-series, infinite products, sums over integer partitions, and continued fractions, to find partition-theoretic formulas to compute the values of constants such as $\pi$, and to connect sums…
We sometimes need to compute the most significant digits of the product of small integers with a multiplier requiring much storage: e.g., a large integer (e.g., $5^{100}$) or an irrational number ($\pi$). We only need to access the most…
Traditional computers work with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not…
We deliver a call to arms for probabilistic numerical methods: algorithms for numerical tasks, including linear algebra, integration, optimization and solving differential equations, that return uncertainties in their calculations. Such…
All but a few digital computers used for scientific computations have supported floating-point and digital arithmetic of rather limited numerical precision. The underlying assumptions were that the systems being studied were basically…
Since the early twentieth century, it has been understood that mathematical definitions and proofs can be represented in formal systems systems with precise grammars and rules of use. Building on such foundations, computational proof…
By using an asymptotic formula known for the numbers of Euler and Bernoulli it is possible to obtain an explicit expression of the nth digit of $\pi$ in decimal or in binary, it also makes it possible to obtain the $n^{\rm th}$ digit of…