Skip to main content

Unbounded spigot algorithms for the digits of pi (2006)

  • Chapter
  • First Online:
  • 2319 Accesses

Abstract

Paper 16: Jeremy Gibbons, “Unbounded spigot algorithms for the digits of pi,” American Mathematical Monthly, vol. 113 (2006), p. 318–328. Copyright 2006 Mathematical Association of America. All Rights Reserved.

Synopsis: In 1995, Rabinowitz and Wagon presented a “spigot” algorithm for π, in a paper included earlier in this volume. One limitation of the Rabinowitz-Wagon algorithm was that the computation was inherently bounded — one has to decide in advance that one will compute up to a certain number of digits.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   79.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

REFERENCES

  1. J. Arndt and C. Haenel, π Unleashed, 2nd ed., Springer-Verlag, Berlin, 2001.

    Book  MATH  Google Scholar 

  2. R. P. Brent, Fast multiple-precision evaluation of elementary functions, J. ACM 23 (1976) 242–251.

    Article  MathSciNet  MATH  Google Scholar 

  3. J. Gibbons. Streaming representation-changers, in Mathematics of Program Construction, D. Kozen, ed., Springer-Verlag, Berlin, 2004, pp. 142–168.

    Chapter  Google Scholar 

  4. R. W. Gosper, Acceleration of series, Technical Report AIM-304, A1 Laboratory, MIT (March 1974); available at ftp://publications.ai.mit.edu/ai-publications/pdf/AIM-304.pdf.

  5. S. Peyton Jones, ed., Haskell 98 Language and Libraries: The Revised Report, Cambridge University Press, Cambridge, 2003.

    MATH  Google Scholar 

  6. Haskell web site, http://www.haskell.org/.

  7. J. C. R. Li et al., Solutions to Problem E854: A series for π, this Monthly 56 (1949) 633–635.

    Google Scholar 

  8. S. Rabinowitz and S. Wagon, A spigot algorithm for the digits of π, this Monthly 102 (1995) 195–203.

    MathSciNet  Google Scholar 

  9. E. Salamin, Computation of π using arithmetic-geometric mean, Math. Comp. 30 (1976) 565–570.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Gibbons, J. (2016). Unbounded spigot algorithms for the digits of pi (2006). In: Pi: The Next Generation. Springer, Cham. https://doi.org/10.1007/978-3-319-32377-0_16

Download citation

Publish with us

Policies and ethics