Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: Is there a polynomial time algorithm for enumerating prime numbers?
Replies: 10   Last Post: Jun 6, 2012 9:53 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Pubkeybreaker

Posts: 1,394
Registered: 2/12/07
Re: Is there a polynomial time algorithm for enumerating prime numbers?
Posted: Jun 5, 2012 6:49 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Jun 5, 5:37 am, "Peter Percival" <peterxperci...@hotmail.com>
wrote:
> Let p_n be the n-th 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.



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.