Related papers: Easy Proofs of Some Borwein Algorithms for $\pi$
Several terminating generalizations of Ramanujan's formula for $\frac{1}{\pi}$ with complete WZ proofs are given.
Methods are described for the solution of linear inference problems subject to deterministic constraints. The approach builds on work by Backus (1970a,b,c) and Parker (1977), but a range useful advances are suggested to address both…
Through an application of a remarkable result due to Mishev in 2018 concerning the inverses for a class of transformations of sequences of complex numbers, we obtain a very simple proof for a famous series for $\frac{1}{\pi}$ due to…
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…
Using some properties of the gamma function and the well-known Gauss summation formula for the classical hypergeometric series, we prove a four-parameter series expansion formula, which can produce infinitely many Ramanujan type series for…
We prove a polynomial continued fraction identity for the constant $-\pi/4$, conjectured by the Ramanujan Machine project. The proof proceeds by explicitly solving the underlying second-order linear difference equation. We derive a…
In our recent publication we have proposed a new methodology for determination of the two-term Machin-like formula for pi with small arguments of the arctangent function of kind $$ \frac{\pi }{4} = {2^{k - 1}}\arctan \left(…
There exist quantum algorithms that are more efficient than their classical counterparts; such algorithms were invented by Shor in 1994 and then Grover in 1996. A lack of invention since Grover's algorithm has been commonly attributed to…
We revisit a classic theorem of Frougny and Sakarovitch concerning automata for $\varphi$-representations, and show how to obtain it in a different and more computationally direct way. Using it, we can find simple, induction-free proofs of…
A direct relation between the enumeration of ordinary maps and that of fully simple maps first appeared in the work of the first and last authors. The relation is via monotone Hurwitz numbers and was originally proved using Weingarten…
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…
We prove the following conjecture, raised by Aaronson and Ambainis in 2008: Let $f:\{-1,1\}^n \rightarrow [-1,1]$ be a multilinear polynomial of degree $d$. Then there exists a variable $x_i$ whose influence on $f$ is at least…
This is an elementary explanation of a cubic composition formula due to Ramanujan.
In this paper we use a theorem first proved by S.W.Golomb and a famous inequality by J.B. Rosser and L.Schoenfeld in order to prove that there exists an exact formula for $\pi(n)$ which holds infinitely often.
We present a brief survey of the methods used in deducing upper estimates for irrationality measures of the logarithm values. We particularly expose the best known estimates for $\log2$ (due to E. Rukhadze), $\pi$ (due to M. Hata) and…
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…
The computation of first and second-order derivatives is a staple in many computing applications, ranging from machine learning to scientific computing. We propose an algorithm to automatically differentiate algorithms written in a subset…
Comparing provers on a formalization of the same problem is always a valuable exercise. In this paper, we present the formal proof of correctness of a non-trivial algorithm from graph theory that was carried out in three proof assistants:…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
Sturm's theorem (1829/35) provides an elegant algorithm to count and locate the real roots of any real polynomial. In his residue calculus (1831/37) Cauchy extended Sturm's method to count and locate the complex roots of any complex…