Advertisement

The computation of previously inaccessible digits of π2 and Catalan’s constant (2013)

  • David H. Bailey
  • Jonathan M. Borwein
  • Andrew Mattingly
  • Glenn Wightwick
Chapter

Abstract

Paper 20: David H. Bailey, Jonathan M. Borwein, Andrew Mattingly and Glenn Wightwick, “The computation of previously inaccessible digits of π 2 and Catalan’s constant,” Notices of the American Mathematical Society, vol. 60 (2013), p. 844–854. Reprinted by permission of the American Mathematical Society.

Synopsis: An earlier selection (paper #14 in this collection) presented what is now known as the BBP formula for π, which permits one to calculate binary or base-16 digits of π beginning at an arbitrary starting point. The original BBP paper presented a similar formula for π 2, permitting arbitrary binary digits of π 2 to be calculated by this same general process. Since the publication of that paper, additional BBP-type formulas have also been found, among them one that permits arbitrary base-3 digits of π 2 to be calculated, and another that permits arbitrary binary digits of Catalan’s constant = \( {\displaystyle {\sum}_{n=0}^{\infty }{\left(-1\right)}^n/{\left(2n+1\right)}^2} = 0.9159965594… \) to be calculated.

Keywords:

Computation History Normality General Audience 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    David H. Bailey, BBP-type formulas, manuscript, 2011, available at http://davidhbailey.com/dhbpapers/bbp-formulas.pdf. A web database version is available at http://www.bbp.carma.newcastle.edu.au.
  2. 2.
    David H. Bailey and Jonathan M. Borwein, Ancient Indian square roots: An exercise in forensic paleomathematics, American Mathematical Monthly 119, no. 8 (Oct. 2012), 646–657.Google Scholar
  3. 3.
    David H. Bailey, Peter B. Borwein, and Simon Plouffe, On the rapid computation of various polylogarithmic constants, Mathematics of Computation 66, no. 218 (1997), 903–913MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    David H. Bailey and David J. Broadhurst, Parallel integer relation detection: Techniques and applications, Mathematics of Computation 70, no. 236 (2000), 1719–1736.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    J. M. Borwein and D. H. Bailey, Mathematics by Experiment: Plausible Reasoning in the 21st Century, A K Peters Ltd., 2004. Expanded Second Edition, 2008.Google Scholar
  6. 6.
    L. Berggren, J. M. Borwein, and P. B. Borwein, Pi: A Source Book, Springer-Verlag, 1997, 2000, 2004. Fourth edition in preparation, 2011.Google Scholar
  7. 7.
    Bibhutibhusan Datta, The Bakhshali mathematics, Bulletin of the Calcutta Mathematical Society 21, no. 1 (1929), 1–60.zbMATHGoogle Scholar
  8. 8.
    Rudolf Hoernle, On the BakhshaliManuscript, Alfred Holder, Vienna, 1887.Google Scholar
  9. 9.
    Georges Ifrah, The Universal History of Numbers: From Prehistory to the Invention of the Computer, translated by David Vellos, E. F. Harding, Sophie Wood, and Ian Monk, John Wiley and Sons, New York, 2000.Google Scholar
  10. 10.
    Alexander Yee, Large computations, 7 Mar 2011, available at http://www.numberworld.org/nagisa_runs/computations.html.
  11. 11.
    Alexander Yee and Shigeru Kondo, 5 trillion digits of pi—new world record, 7 Mar 2011, available at http://www.numberworld.org/misc_runs/pi-5t/details.html.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • David H. Bailey
    • 1
  • Jonathan M. Borwein
    • 2
  • Andrew Mattingly
    • 3
  • Glenn Wightwick
    • 3
  1. 1.Lawrence Berkeley National LaboratoryBerkeleyUSA
  2. 2.University of NewcastleNewcastleAustralia
  3. 3.IBM AustraliaSydneyAustralia

Personalised recommendations