Re: Question on Pi

On 29 Dec 2005 21:13:52 GMT, David W. Cantrell
<DWCantrell@xxxxxxxxxxx> wrote:

>David W. Cantrell <DWCantrell@xxxxxxxxxxx> wrote:
>> "Robert J. Kolker" <nowhere@xxxxxxxxxxx> wrote:
>> > andre.maier@xxxxxxx wrote:
>> > > Does such an algorithm exist at all?
>> >
>> > Yes. There is such an algorithm.

>> > http://www.math.hmc.edu/funfacts/ffiles/20010.5.shtml
>>
>> That algorithm gives hexadecimal digits. Andre probably wanted decimal
>> digits. Clearly, he didn't want hexadecimal digits because he said
>> f(3) = 1 rather than f(3) = 3.
>>
>> AFAIK, an algorithm similar to BBP's but giving decimal digits has yet to
>> be devised.
Repeating an earlier response to a similar question:
(Message-ID: <4049cf8a.152508653@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>)
Actually,
http://www.labmath.uqam.ca/~plouffe/Simon/BaileyBorweinPlouffe.pdf
ON THE RAPID COMPUTATION OF VARIOUS POLYLOGARITHMIC CONSTANTS by
Bailey, Borwein and Plouffe gives the binary digit formula, which you
ask for, but the quoted formula and other URL gives the decimal digit
technique. Using the "formula" is not straight forward and before you
use it, read the article. FURTHERMORE: After posting a note:

(Message-ID: <3c1cbb31.409168...@xxxxxxxxxxxxxxxxxxxx>)
saying that http://www.lacim.uqam.ca/plouffe/Simon/articlepi.html
presents a method for finding the nth decimal digit of pi, I got the
following personal note from David Bailey, who while not my cousin is
a member of the Bailey, Borwein, Plouffe trio who pioneered nth digit
of pi calculation.

David H Bailey wrote:

Yes, I'm aware of this scheme. The problem is that it is much too
expensive. As I recall the work increases as the cube of the index,
so
that even for the 1,000th decimal digit it is too expensive to be
usable. It is far cheaper to calculate all digits up to the 1,000th
digits. Thus this "algorithm" is moot.

DHB
(end quote)

So there it is, and it isn't.
John Bailey
http://home.rochester.rr.com/jbxroads/mailto.html
.

Relevant Pages

  • "Algorithmic Randomness, Quantum Physics, and Incompleteness"
    ... all finite sequences are to be found infinitely often and ... different members of the infinite set of random numbers. ... Just using random numbers with initial digits 1 thru 9, ... it generated by a shorter input algorithm than the length ...
    (sci.logic)
  • Re: BigNum -- Floating Point
    ... > It means the memory required for representing a number is just ... write an RSA algorithm, for example. ... interest might be something like pi...in base N...to M digits. ... >> wouldn't the gcd() itself need to be able to handle bigints? ...
    (comp.programming)
  • Re: BCD List to HEX List
    ... nibbles, shifting, and adding, Those are pretty simple, so I asked ... algorithm what the algorithm is intended to achieve ... ... input was a list of decimal digits. ... was to go from BCD to a normal binary integer, ...
    (comp.lang.python)
  • Re: BCD List to HEX List
    ... nibbles, shifting, and adding, Those are pretty simple, so I asked ... algorithm what the algorithm is intended to achieve ... ... that he had lists of digits rather than an integer datatype. ... input was a list of decimal digits. ...
    (comp.lang.python)
  • Re: singleton vs static
    ... it broadcasts the digits to Martians... ... this might be an algorithm that returns n ... All you need is sufficient analysis to be able ... test involving one time through the loop is sufficient to conclude that the ...
    (comp.object)