Re: Question on Pi
- From: Raymond Manzoni <raymond.manzoni@xxxxxxxxxx>
- Date: Thu, 29 Dec 2005 22:02:46 +0100
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? If yes, do you have a Java implementation by chance?
Thanks in advance,
Andre
Hi,
You may have a look at Fabrice Bellard's Pi page : http://fabrice.bellard.free.fr/pi/ or directly http://fabrice.bellard.free.fr/pi/pi_n2/pi_n2.html you should even find C code with a running time of O(n^2)
You may look too Simon Plouffe's work here : http://www.lacim.uqam.ca/%7Eplouffe/Simon/articlepi.html
Hoping it helped, Raymond .
- References:
- Question on Pi
- From: andre . maier
- Question on Pi
- Prev by Date: Re: Exponential equation
- Next by Date: Re: which later courses is the "Linear Algebra" course usally required as a prereq?
- Previous by thread: Re: Question on Pi
- Next by thread: Re: Question on Pi
- Index(es):
Relevant Pages
|