Guido van Rossum | f06ee5f | 1996-11-27 19:52:01 +0000 | [diff] [blame] | 1 | #! /usr/bin/env python |
Guido van Rossum | ec758ea | 1991-06-04 20:36:54 +0000 | [diff] [blame] | 2 | |
| 3 | # Print digits of pi forever. |
| 4 | # |
| 5 | # The algorithm, using Python's 'long' integers ("bignums"), works |
| 6 | # with continued fractions, and was conceived by Lambert Meertens. |
| 7 | # |
| 8 | # See also the ABC Programmer's Handbook, by Geurts, Meertens & Pemberton, |
| 9 | # published by Prentice-Hall (UK) Ltd., 1990. |
| 10 | |
| 11 | import sys |
| 12 | |
| 13 | def main(): |
Guido van Rossum | 0b2b440 | 1992-08-31 10:54:17 +0000 | [diff] [blame] | 14 | k, a, b, a1, b1 = 2L, 4L, 1L, 12L, 4L |
Guido van Rossum | ec758ea | 1991-06-04 20:36:54 +0000 | [diff] [blame] | 15 | while 1: |
| 16 | # Next approximation |
Guido van Rossum | 0b2b440 | 1992-08-31 10:54:17 +0000 | [diff] [blame] | 17 | p, q, k = k*k, 2L*k+1L, k+1L |
Guido van Rossum | ec758ea | 1991-06-04 20:36:54 +0000 | [diff] [blame] | 18 | a, b, a1, b1 = a1, b1, p*a+q*a1, p*b+q*b1 |
| 19 | # Print common digits |
| 20 | d, d1 = a/b, a1/b1 |
Guido van Rossum | bdfcfcc | 1992-01-01 19:35:13 +0000 | [diff] [blame] | 21 | while d == d1: |
Guido van Rossum | 0b2b440 | 1992-08-31 10:54:17 +0000 | [diff] [blame] | 22 | output(d) |
| 23 | a, a1 = 10L*(a%b), 10L*(a1%b1) |
Guido van Rossum | ec758ea | 1991-06-04 20:36:54 +0000 | [diff] [blame] | 24 | d, d1 = a/b, a1/b1 |
| 25 | |
Guido van Rossum | 0b2b440 | 1992-08-31 10:54:17 +0000 | [diff] [blame] | 26 | def output(d): |
| 27 | # Use write() to avoid spaces between the digits |
| 28 | # Use int(d) to avoid a trailing L after each digit |
| 29 | sys.stdout.write(`int(d)`) |
| 30 | # Flush so the output is seen immediately |
| 31 | sys.stdout.flush() |
| 32 | |
Guido van Rossum | ec758ea | 1991-06-04 20:36:54 +0000 | [diff] [blame] | 33 | main() |