# Unbounded spigot algorithms for the digits of pi

- Published in 2006
- Added on

In the collections

## Comment

There are several algorithms which produce digits of π one at a time. This paper presents one which doesn't commit to a number of digits at the start, with Haskell code. The idea is that you write π as the composition of infinitely many Mobius transforms, which are implemented as integer matrix multiplications.

## Links

## Other information

- key
- Gibbons2006
- type
- article
- date_added
- 2010-01-05
- date_published
- 2006-02-02
- journal
- American Mathematical Monthly
- number
- 4
- pages
- 318--328
- publisher
- Citeseer
- volume
- 113

### BibTeX entry

@article{Gibbons2006, key = {Gibbons2006}, type = {article}, title = {Unbounded spigot algorithms for the digits of pi}, author = {Gibbons, J.}, abstract = {}, comment = {There are several algorithms which produce digits of π one at a time. This paper presents one which doesn't commit to a number of digits at the start, with Haskell code. The idea is that you write π as the composition of infinitely many Mobius transforms, which are implemented as integer matrix multiplications.}, date_added = {2010-01-05}, date_published = {2006-02-02}, urls = {http://www.cs.ox.ac.uk/jeremy.gibbons/publications/spigot.pdf}, collections = {Basically computer science,Fun maths facts}, journal = {American Mathematical Monthly}, number = 4, pages = {318--328}, publisher = {Citeseer}, url = {http://www.cs.ox.ac.uk/jeremy.gibbons/publications/spigot.pdf}, volume = 113, year = 2006, urldate = {2010-01-05} }