Interesting Esoterica

Unbounded spigot algorithms for the digits of pi

Article by Gibbons, J.
  • Published in 2006
  • Added on

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

journal
American Mathematical Monthly
number
4
pages
318--328
publisher
Citeseer
volume
113

BibTeX entry

@article{Gibbons2006,
	author = {Gibbons, J.},
	journal = {American Mathematical Monthly},
	number = 4,
	pages = {318--328},
	publisher = {Citeseer},
	title = {Unbounded spigot algorithms for the digits of pi},
	url = {http://www.cs.ox.ac.uk/jeremy.gibbons/publications/spigot.pdf},
	volume = 113,
	year = 2006,
	urldate = {2010-01-05},
	collections = {Basically computer science,Fun maths facts},
	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.}
}