query: What's the fastest and most efficent way to find prime numbers?
positive_passages.docid: 146066
positive_passages.text: Fastest way to find if a given number is prime
negative_passages.docid: 78847
negative_passages.text: Bijection between Prime numbers and Natural numbers
negative_passages.docid: 35382
negative_passages.text: What is the fastest algorithm for finding the natural logarithm of a big number?
negative_passages.docid: 56229
negative_passages.text: On the difference between consecutive primes
negative_passages.docid: 98692
negative_passages.text: How can I test for primality?
negative_passages.docid: 101987
negative_passages.text: Is there possibly a largest prime number?
negative_passages.docid: 112359
negative_passages.text: How to deal with a Pell's equation type problem with two primes
negative_passages.docid: 51305
negative_passages.text: How to verify large Mersenne Primes
negative_passages.docid: 64883
negative_passages.text: What is the most efficient algorithm to find the closest prime less than a given number $n$
negative_passages.docid: 108360
negative_passages.text: How to do this the fastest way?
negative_passages.docid: 34047
negative_passages.text: Books on Prime numbers
negative_passages.docid: 27686
negative_passages.text: How can I generate large prime numbers for RSA?
negative_passages.docid: 45144
negative_passages.text: Another way to write least prime factor.
negative_passages.docid: 72666
negative_passages.text: Prime Numbers And Perfect Squares
negative_passages.docid: 89066
negative_passages.text: Find all integers less than $m$ that are relatively prime to it
negative_passages.docid: 3007
negative_passages.text: Currently, what is the largest publicly known prime number such that all prime numbers less than it are known?
negative_passages.docid: 116178
negative_passages.text: Prime Number Determination Javascript