diff options
Diffstat (limited to 'Demo')
| -rw-r--r-- | Demo/scripts/README | 1 | ||||
| -rwxr-xr-x | Demo/scripts/mpzpi.py | 34 |
2 files changed, 0 insertions, 35 deletions
diff --git a/Demo/scripts/README b/Demo/scripts/README index 5c8ecc7..d8434e8 100644 --- a/Demo/scripts/README +++ b/Demo/scripts/README @@ -14,7 +14,6 @@ markov.py Markov chain simulation of words or characters mboxconvvert.py Convert MH or MMDF mailboxes to unix mailbox format mkrcs.py Fix symlinks named RCS into parallel tree morse.py Produce morse code (audible or on AIFF file) -mpzpi.py test mpz -- print digits of pi (compare pi.py) pi.py Print all digits of pi -- given enough time and memory pp.py Emulate some Perl command line options primes.py Print prime numbers diff --git a/Demo/scripts/mpzpi.py b/Demo/scripts/mpzpi.py deleted file mode 100755 index 70b1a51..0000000 --- a/Demo/scripts/mpzpi.py +++ /dev/null @@ -1,34 +0,0 @@ -#! /usr/bin/env python -# 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 -from mpz import mpz - -def main(): - mpzone, mpztwo, mpzten = mpz(1), mpz(2), mpz(10) - k, a, b, a1, b1 = mpz(2), mpz(4), mpz(1), mpz(12), mpz(4) - while 1: - # Next approximation - p, q, k = k*k, mpztwo*k+mpzone, k+mpzone - a, b, a1, b1 = a1, b1, p*a+q*a1, p*b+q*b1 - # Print common digits - d, d1 = a/b, a1/b1 - while d == d1: - output(d) - a, a1 = mpzten*(a%b), mpzten*(a1%b1) - d, d1 = a/b, a1/b1 - -def output(d): - # Use write() to avoid spaces between the digits - # Use int(d) to avoid a trailing L after each digit - sys.stdout.write(repr(int(d))) - # Flush so the output is seen immediately - sys.stdout.flush() - -main() |