
Re: Is there a polynomial time algorithm for enumerating prime numbers?
Posted:
Jun 5, 2012 6:49 AM


On Jun 5, 5:37 am, "Peter Percival" <peterxperci...@hotmail.com> wrote: > Let p_n be the nth prime number (p_1 = 2, etc). Is there a polynomial > P(n), and an algorithm to find p_n in a number of steps* S(n), where S(n) > is bounded by P(n)? > The answer is yes.

