On the computation and verification of π using BBP-type formulas

On the computation and verification of π using BBP-type formulas

In this paper, we propose two Bailey–Borwein–Plouffe (BBP)-type formulas for π . We show that computation and verification of π using the two different BBP-type formulas require 20% fewer terms than verification by shifting the starting position of a few hexadecimal digits of π using Huvent’s formul...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Ramanujan journal 2020-01, Vol.51 (1), p.177-186
1. Verfasser: Takahashi, Daisuke
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorics
Computation
Digits
Field Theory and Polynomials
Fourier Analysis
Functions of a Complex Variable
Mathematics
Mathematics and Statistics
Number Theory
Program verification (computers)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we propose two Bailey–Borwein–Plouffe (BBP)-type formulas for π . We show that computation and verification of π using the two different BBP-type formulas require 20% fewer terms than verification by shifting the starting position of a few hexadecimal digits of π using Huvent’s formula, which is known as the BBP-type formula with the least number of terms.
ISSN:1382-4090
1572-9303
DOI:10.1007/s11139-018-0104-x