Related papers: New proofs of Borwein-type algorithms for Pi
Let $E=((e_{ij}))_{n\times n}$ be a fixed array of real numbers such that $e_{ij}=e_{ji}, e_{ii}=0$ for $1\le i,j \le n$. Let the permutation group be denoted by $S_n$ and the collection of involutions with no fixed points by $\Pi_n$, that…
Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…
Our main results are a WZ-proof of a new Ramanujan-like series for $1/\pi^2$ and a hypergeometric identity involving three series.
In this paper, we present a new iterative approximate method of solving boundary value problems. The idea is to compute approximate polynomial solutions in the Bernstein form using least squares approximation combined with some properties…
Lattice QCD should allow a derivation of the $\Delta I=1/2$ rule from first principles, but numerical calculations to date have been plagued by a variety of problems. After a brief review of these problems, we present several new methods…
An application of (iterated) Bauer-Muir acceleration can give an Ap\'ery-like continued fraction for $\pi$ with irrational coefficients, and much faster convergence. It can be considered a generalized continued fraction with the same matrix…
We say that a permutation $\pi$ is a Motzkin permutation if it avoids 132 and there do not exist $a<b$ such that $\pi_a<\pi_b<\pi_{b+1}$. We study the distribution of several statistics in Motzkin permutations, including the length of the…
In this Note, we start off with the primary representation of e and from there present an elementary short proof for the Wallis formula for $\pi$.
We use the Wilf-Zeilberger method to prove identities between Mahler measures of polynomials. In particular, we offer a new proof of a formula due to Lal\'{i}n, and we show how to translate the identity into a formula involving elliptic…
In a recent paper [1] we have proposed a new approach for extracting the wave function of the $\pi$-meson $\varphi_{\pi}(x)$ and the masses and wave functions of its first resonances from the new QCD sum rules for non-diagonal correlators…
Recently, Li obtained an asymptotic formula for a certain partial sum involving coefficients for the polynomial in the First Borwein conjecture. As a consequence, he showed the positivity of this sum. His result was based on a sieving…
For the OEIS sequence A176677, defined by the quadratic convolution recurrence $a(0) = a(1) = 1$ and $a(n+1) = \sum_{p=0}^n a(p) a(n-p) - 1$ for $n \ge 1$, R.~J.~Mathar contributed in March 2016 the conjectured order-4 P-recursive…
We present a novel approach to Gaussian Berezin correlation functions. A formula well known in the literature expresses these quantities in terms of submatrices of the inverse matrix appearing in the Gaussian action. By using a recently…
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…
Lothar Collatz had proposed in 1937 a conjecture in number theory called Collatz conjecture. Till today there is no evidence of proving or disproving the conjecture. In this paper, we propose an algorithmic approach for verification of the…
We develop a new method for showing that a given sequence of random variables verifies an appropriate law of the iterated logarithm. Our tools involve the use of general estimates on multidimensional Wasserstein distances, that are in turn…
By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.
We use techniques of proof mining to extract computable and uniform rates of metastability (in the sense of Tao) for iterations of continuous functions on the unit interval, firstly (following earlier work of Gaspar) out of convergence…
New formulas for 1/Pi^2 are found by transforming Guillera's formulas
Methods for the computation of classical Gaussian quadrature rules are described which are effective both for small and large degree. These methods are reliable because the iterative computation of the nodes has guaranteed convergence, and…