How quickly can we find a prime at least as great as $n$?
This may be trivial, but I'm wondering a few things. Is there an easy way
to find a prime of the form $2k+1>n$ for some $n$?
EDIT How quickly can we find a prime greater than a given number $n$?
No comments:
Post a Comment