MathGroup Archive 2000

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Question on version 4 and long Pi calculations.....

  • To: mathgroup at
  • Subject: [mg23581] Re: Question on version 4 and long Pi calculations.....
  • From: "Atul Sharma" <atulksharma at>
  • Date: Sun, 21 May 2000 18:12:50 -0400 (EDT)
  • Organization: McGill University
  • References: <8fqrvb$>
  • Sender: owner-wri-mathgroup at

I apologize if this is off tangent, and I confess to be woefully ignorant on
this (and many other) subjects, but there are algorithms for calculating
digits of pi without having to calculate the intermediate digits, if that's
I originally came across it while looking for an alternate pseudorandom
number generator.
A very nice review is available at the David Bailey's web site, where the
author describes it as

This work is an outgrowth of a 1997 result (by myself, Peter Borwein and
Plouffe) that the n-th binary digit of pi (and some other constants) is
given by a simple formula, independent of the first n-1 digits.

Atul Sharma MD, FRCP(C)
Pediatric Nephrologist,
McGill University/Montreal Children's Hospital
zeno at wrote in message <8fqrvb$h66 at>...
>I know that version 4 can calculate Pi much faster than previous
>versions..the web site though mentions "up to 10 million" places, etc. Does
>that mean the extreme speed increase is for only up to the first 10 million
>places? Or is the speed increase the same for any amount of places, and the
>only limit is ones memeory? If one had enough memory, could one calculte Pi
>to 50 milion places with a great speed increase in addition to 1 milion
>places or 10 million?

  • Prev by Date: Re: Mathematica course
  • Next by Date: Re: ContourPlots,DensityPlots
  • Previous by thread: Re: Question on version 4 and long Pi calculations.....
  • Next by thread: multiplying a list of matrices together