Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Bailey-Borwein-Plouffe formula

Numerical Algorithm

The Bailey-Borwein-Plouffe formula, called the BBP formula, is a formula for pi. It was discovered in 1995 by Simon Plouffe and is named after the authors of the article in which it was published, David H. Bailey, Peter Borwein and Plouffe. The formula gives rise to a spigot algorithm that computes the nth hexadecimal digit of pi, and so also the 4nth binary digit, without computing the preceding digits. It does not extract decimal digits directly. Its existence was a surprise, because it had been widely believed that computing the nth digit of pi is as hard as computing the first n digits. Projects such as PiHex have used BBP and BBP-inspired algorithms in distributed computing, and formulas of the same general form have since been found for many other irrational numbers.

Connections

Credited To

Source Bailey-Borwein-Plouffe formula (Wikipedia)

In Field

Source Bailey-Borwein-Plouffe formula (Wikipedia)

Invented

Source Bailey-Borwein-Plouffe formula (Wikipedia)
Sources
Bailey-Borwein-Plouffe formula (Wikipedia)
  • In Group: Number Theory and Primality, Lead
    The BBP formula gives rise to a spigot algorithm for computing the nth base-16 (hexadecimal) digit of π
  • In Field: Algorithms and Complexity Theory, Lead [in-field]
    The Bailey-Borwein-Plouffe formula (BBP formula) is a formula for π.
  • Credited To: Simon Plouffe, Lead
    It was discovered in 1995 by Simon Plouffe
  • Invented: Simon Plouffe, Lead
    It was discovered in 1995 by Simon Plouffe
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.