query: Usefulness of largest known prime
positive_passages.docid: 156574
positive_passages.text: Why it is important to find largest prime numbers?
negative_passages.docid: 35096
negative_passages.text: Is the $n$-th prime smaller than $n(\log n + \log\log n-1+\frac{\log\log n}{\log n})$?
negative_passages.docid: 53557
negative_passages.text: Java: A "prime" number or a "power of two" as HashMap size?
negative_passages.docid: 132830
negative_passages.text: What place do prime numbers have in cryptography?
negative_passages.docid: 8740
negative_passages.text: What is so special about Prime?
negative_passages.docid: 68221
negative_passages.text: Question regardles primes and the fundamental theorem of arithmetic
negative_passages.docid: 8142
negative_passages.text: Algorithm to find Largest prime factor of a number
negative_passages.docid: 51305
negative_passages.text: How to verify large Mersenne Primes
negative_passages.docid: 27686
negative_passages.text: How can I generate large prime numbers for RSA?
negative_passages.docid: 75733
negative_passages.text: Divisibility of prime numbers
negative_passages.docid: 53457
negative_passages.text: Concurrent Prime Generator
negative_passages.docid: 38727
negative_passages.text: Modular Exponentiation and Primes
negative_passages.docid: 123296
negative_passages.text: Determine whether a number is prime
negative_passages.docid: 158213
negative_passages.text: RSA with probable primes
negative_passages.docid: 14240
negative_passages.text: Approximating next prime number
negative_passages.docid: 25232
negative_passages.text: Is this formula for the $n^{th}$ prime number useful?
negative_passages.docid: 17528
negative_passages.text: Which is the fastest algorithm to find prime numbers?