1996-11-27 15:52:01 -04:00
|
|
|
#! /usr/bin/env python
|
1991-06-04 17:36:54 -03:00
|
|
|
|
|
|
|
# Print digits of pi forever.
|
|
|
|
#
|
|
|
|
# The algorithm, using Python's 'long' integers ("bignums"), works
|
|
|
|
# with continued fractions, and was conceived by Lambert Meertens.
|
|
|
|
#
|
|
|
|
# See also the ABC Programmer's Handbook, by Geurts, Meertens & Pemberton,
|
|
|
|
# published by Prentice-Hall (UK) Ltd., 1990.
|
|
|
|
|
|
|
|
import sys
|
|
|
|
|
|
|
|
def main():
|
2009-10-10 18:10:05 -03:00
|
|
|
k, a, b, a1, b1 = 2, 4, 1, 12, 4
|
|
|
|
while True:
|
2001-02-20 12:13:43 -04:00
|
|
|
# Next approximation
|
2009-10-10 18:10:05 -03:00
|
|
|
p, q, k = k*k, 2*k+1, k+1
|
2001-02-20 12:13:43 -04:00
|
|
|
a, b, a1, b1 = a1, b1, p*a+q*a1, p*b+q*b1
|
|
|
|
# Print common digits
|
2008-09-12 22:43:28 -03:00
|
|
|
d, d1 = a//b, a1//b1
|
2001-02-20 12:13:43 -04:00
|
|
|
while d == d1:
|
|
|
|
output(d)
|
2009-10-10 18:10:05 -03:00
|
|
|
a, a1 = 10*(a%b), 10*(a1%b1)
|
2008-09-12 22:43:28 -03:00
|
|
|
d, d1 = a//b, a1//b1
|
1991-06-04 17:36:54 -03:00
|
|
|
|
1992-08-31 07:54:17 -03:00
|
|
|
def output(d):
|
2001-02-20 12:13:43 -04:00
|
|
|
# Use write() to avoid spaces between the digits
|
|
|
|
sys.stdout.write(str(d))
|
|
|
|
# Flush so the output is seen immediately
|
|
|
|
sys.stdout.flush()
|
1992-08-31 07:54:17 -03:00
|
|
|
|
2004-09-11 13:34:35 -03:00
|
|
|
if __name__ == "__main__":
|
|
|
|
main()
|