***Forwarded Messages From Our Original Source***
I computed the digits of pi using Borwein's method. I used a divide-
and-conquer multiply routine, hand coded in 68020 assembly language.
It was capable of multiplying two 1.25+ million digit numbers in about
20 minutes on an HP 9000/370 (a 25MHz 68030?). The computation took a
little over three days, at which point I had the answer in *binary*. :-(
The binary to decimal conversion was no simple task.
I checked my results by performing the same calculation to 2.5+ million
digit precision, (9 days) and compared the binaries. The only independent
check has come from David Bailey, whose results agree with mine to at least
1 million digits (probably.... The last 100 digits are the same.)
Scott Hemphill email@example.com
***End of Forwarded Messages***
The digits are arranged in groups of 1,000 in an array
of five sets of ten digits per line in twenty lines to
a screen with four blank lines between groups of 1,000
so search programs such as LIST can be used to scan in
page mode keeping the groups of 1,000 screen centered.
While we cannot guarantee accuracy, these figures have