New proofs of Borwein-type algorithms for Pi

2016/04/01 by Guillera, Jesús
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1604.00193

Abstract

We use a method of translation to recover Borweins' quadratic and quartic iterations. Then, by using the WZ-method, we obtain some initial values which lead to the limit 1/π. We will not use the modular theory nor either the Gauss' formula that we used in another paper. Our proofs are short and self-contained.

Related

• Easy Proofs of Some Borwein Algorithms for π
• Easy Proof of Three Recursive π-Algorithms -- Einfacher Beweis dreier rekursiver π-Algorithmen
• Self-replication and Borwein-like algorithms
• An extension of the Chudnovsky algorithm
• Reprint: On the approximation of π (1953)