I was reading Petr Beckmann's book on the history of pi, which includes a chapter
on the digit hunters (people who calculated pi to large numbers of digits).
He says that (repeatedly) calculating pi to large numbers of places is a good way
of testing whether a machine is functioning accurately.
I just looked with google for such a program but couldn't find anything that went
beyond the bit width (32 or 64) of the host machine. Does anyone know where
I can get the code? How do you do a calculation to 10^6 places on a 32 bit
machine?
Thanks Joe
--
Joseph Mack PhD, High Performance Computing & Scientific Visualization
SAIC, Supporting the EPA Research Triangle Park, NC 919-541-0007
Federal Contact - John B. Smith 919-541-1087 - smith.johnb at epa.gov
_______________________________________________
Beowulf mailing list, Beowulf at beowulf.org
To change your subscription (digest mode or unsubscribe) visit http://www.beowulf.org/mailman/listinfo/beowulf