Related papers: The fastest series for $1/\pi$ due to Ramanujan. P…
In this short paper Euler gives a highly convergent series for arctan and thus pi, which converges much faster than the Leibniz series for arctan.
We prove some "divergent" Ramanujan-type series for $1/\pi$ and $1/\pi^2$ applying a Barnes-integrals strategy of the WZ-method.
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…
In this note, we evaluate a series for $1/\pi$ conjectured by Sun. Our proof uses the Cauchy product and hypergeometric transformations. From this result, we derive two additional analogous series for $1/\pi$ involving polynomials of degree…
Using the WZ-method we find some of the easiest Ramanujan's formulae and also some new interesting Ramanujan-like sums.
In this work, we establish modular parameterizations for two general formulas for $\frac{1}{\pi}$ that subsume conjectural Ramanujan type formulas due to Z.-W. Sun, which have remained open since 2011. As an application of this, in a…
When Mike Hirschhorn showed us his lovely gem, that gives the simplest-to-date proof of Ramanujan's famous result that p(11n+6) is divisible by 11, we realized that his amazing method can be extended, and taught to a computer, and can prove…
We prove rational alternating Ramanujan-type series of level $1$ discovered by the brothers David and Gregory Chudnovky, by using a method of the author. We have carried out the computations with Maple (a symbolic software for mathematics).
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…
Ramanujan's series for Pi, that appeared in his famous letter to Hardy, is given a one-line WZ proof.
The hypergeometric formulae designed by Ramanujan more than a century ago for efficient approximation of $\pi$, Archimedes' constant, remain an attractive object of arithmetic study. In this note we discuss some $q$-analogues of…
Using generalized binomial coefficient identities and some results of John Dougall, we derive some families of series involving the cubes of Catalan numbers. We also establish a family of series containing fourth powers of Catalan numbers.…
In this article, we define functions analogous to Ramanujan's function $f(n)$ defined in his famous paper "Modular equations and approximations to $\pi$". We then use these new functions to study Ramanujan's series for $1/\pi$ associated…
This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum…
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 this paper, we consider a general form of the analogue of Ramanujan's sum in the ring of polynomials over a finite field. We first prove some multiplicative properties of such functions before considering their finite Fourier series and…
We give a simple unified proof for all existing rational hypergeometric Ramanujan identities for $1/\pi$, and give a complete survey (without proof) of several generalizations: rational hypergeometric identities for $1/\pi^c$, Taylor…
Ramanujan in his notebook recorded two modular equations involving multiplier with moduli of degrees (1,7) and (1,23). In this paper, we find some new Ramanujan's modular equations involving multiplier with moduli of degrees (3,5) and…
We use properties of modular forms to prove the following extension of the Ramanujan-Mordell formula, \begin{align*} z^{k-j}z_p^{j}=&\frac{p_{\chi}^{k-j}-1}{p_{\chi}^{k}-1}F_p(k,j;\tau)+…
We describe how the Hardy-Ramanujan-Rademacher formula can be implemented to allow the partition function $p(n)$ to be computed with softly optimal complexity $O(n^{1/2+o(1)})$ and very little overhead. A new implementation based on these…