Re: getting nth prime

Ben Rudiak-Gould wrote:
> 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.

Interesting but not what he asked. The functions are functions which
generate primes but not in any strict order.

Wilson's theorem looks neato but it's also fully exponential. So none
to useful.

Tom
Received on Mon May 1 02:04:04 2006