# Unbounded spigot algorithms for the digits of pi

• Published in 2006
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.

## Other information

key
Gibbons2006
type
article
2010-01-05
date_published
2006-09-14
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.},
}