Easy Proofs of Some Borwein Algorithms for π

2008/03/07 by Jesús Guillera, Guillera, Jesus
Computer Science · Mathematics · #33E05 #Advanced Combinatorial Mathematics #Algebraic Geometry and Number Theory #Classical Analysis and ODEs (math.CA) #Coding theory and cryptography #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.0803.0991

openalex publication_date 2008/03/07 · openalex created_date 2024/04/10 · openalex updated_date 2026/07/28

Abstract

In 1987 Jonathan and Peter Borwein, inspired by the works of Ramanujan, derived many efficient algorithms for computing π. We will see that by using only a formula of Gauss's and elementary algebra we are able to prove the correctness of two of them.

Related

• New proofs of Borwein-type algorithms for Pi
• Self-replication and Borwein-like algorithms
• Easy Proof of Three Recursive π-Algorithms -- Einfacher Beweis dreier rekursiver π-Algorithmen
• A Fast Self-correcting π Algorithm
• The combinatorial algorithm for computing pi(x)