Re: getting nth prime
Available news archives: comp.lang.tcl - comp.lang.python - comp.security.firewalls - sci.crypt - comp.lang.php - comp.lang.javascript
Google
 
Web news.hping.org


sci.crypt archive

Re: getting nth prime

From: Ben Rudiak-Gould <br276deleteme@cam.ac.uk>
Date: Mon Apr 24 2006 - 18:49:44 CEST



Dhairyas wrote:


>    Is there ne algorithm other than Earosthene Sieve to find the Nth


> prime number



Not only are there algorithms, there are formulas:



     http://en.wikipedia.org/wiki/Formula_for_primes



I don't think there's any algorithm more efficient than the Sieve of 


Eratosthenes, though.



-- Ben


Received on Mon May  1 02:04:00 2006