Related papers: Easy Proofs of Some Borwein Algorithms for $\pi$
Given an arbitrary ordered pair of coprime integers (a,b) we obtain a pair of identities of the Rogers--Ramanujan type. These identities have the same product side as the (first) Andrews--Gordon identity for modulus 2ab\pm 1, but an…
Quantum computing takes fully advantage of the superposition principle to increase greatly (even exponentially) the speed of calculations, relative to the classical approach. The Deutsch-Jozsa algorithm is the simplest quantum algorithm…
As rewards of reading two great papers of Hermite from 1873, we trace the historical origin of the integral Niven used in his well-known proof of the irrationality of $\pi$, uncover a rarely acknowledged simple proof by Hermite of the…
The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…
Inspired by the recent pioneering work, dubbed "The Ramanujan Machine" by Raayoni et al. (arXiv:1907.00205), we (automatically) [rigorously] prove some of their conjectures regarding the exact values of some specific infinite continued…
A method for computing the n'th decimal digit of pi in O(n^3 log(n)^3) time and with very little memory is presented here. The computation is based on the recently discovered Bailey-Borwein-Plouffe algorithm and the use of a new algorithm…
A fast and accurate algorithm for the computation of Gauss-Hermite and generalized Gauss-Hermite quadrature nodes and weights is presented. The algorithm is based on Newton's method with carefully selected initial guesses for the nodes and…
In this article, we consider a simple representation for real numbers and propose top-down procedures to approximate various algebraic and transcendental operations with arbitrary precision. Detailed algorithms and proofs are provided to…
This paper presents an algorithm for computing Groebner bases based upon labeled polynomials and ideas from the algorithm F5. The main highlights of this algorithm compared with analogues are simplicity both of the algorithm and of the its…
We outline an elementary method for proving numerical hypergeometric identities, in particular, Ramanujan-type identities for $1/\pi$. The principal idea is using algebraic transformations of arithmetic hypergeometric series to translate…
This is a letter to the editor concerning Semjon Adlaj's article "An eloquent formula for the perimeter of an ellipse", AMS Notices 59, 8 (2012), 1094-1099.
In this paper we give another proof of the Chudnovsky formula for calculating $\pi$ - a proof in detail with means of basic complex analysis. With the exception of the tenth chapter, the proof is self-contained, with proofs provided for all…
This article, dedicated with admiration in memory of Jon and Peter Borwein, illustrates by example, the power of experimental mathematics, so dear to them both, by experimenting with so-called Apery limits and WZ pairs. In particular we…
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
Gaussian building blocks are essential for photonic quantum information processing, and universality can be practically achieved by equipping Gaussian circuits with adaptive measurement and feedforward. The number of adaptive steps then…
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these…
Ramanujan's celebrated congruences of the partition function $p(n)$ have inspired a vast amount of results on various partition functions. Kwong's work on periodicity of rational polynomial functions yields a general theorem used to…
In 1973, L.A. Levin published an algorithm that solves any inversion problem $\pi$ as quickly as the fastest algorithm $p^*$ computing a solution for $\pi$ in time bounded by $2^{l(p^*)}.t^*$, where $l(p^*)$ is the length of the binary…
Sometimes we need the approximate value of the partition number in a simple and efficient way. There are already several formulae to calculate the partition number p(n). But they are either inconvenient for most people (not majored in math)…
List decoding of Hermitian codes is reformulated to allow an efficient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Groebner bases of modules. The computational complexity of the algorithm…