Re: Question on Pi
- From: David W. Cantrell <DWCantrell@xxxxxxxxxxx>
- Date: 29 Dec 2005 21:13:52 GMT
David W. Cantrell <DWCantrell@xxxxxxxxxxx> wrote:
> "Robert J. Kolker" <nowhere@xxxxxxxxxxx> wrote:
> > andre.maier@xxxxxxx wrote:
> > > Hi all,
> > >
> > > I'm looking for an algorithm that allows to calculate
> > > a specific digit of Pi directly, whereas the only
> > > parameter is the position of the digit.
> > >
> > > e.g. f(2) = 4, f(3) = 1, ... and so on.
> > > | |
> > > int int
> > >
> > > Does such an algorithm exist at all?
> >
> > Yes. There is such an algorithm.
> >
> > See
> >
> > 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.
Thanks to RM's response, I see now that it has been devised.
David
.
- Follow-Ups:
- Re: Question on Pi
- From: John Bailey
- Re: Question on Pi
- References:
- Question on Pi
- From: andre . maier
- Re: Question on Pi
- From: Robert J. Kolker
- Re: Question on Pi
- From: David W . Cantrell
- Question on Pi
- Prev by Date: Re: x^2-1 = 0 mod p^k
- Next by Date: Re: Prime sequences
- Previous by thread: Re: Question on Pi
- Next by thread: Re: Question on Pi
- Index(es):
Relevant Pages
|