query: Is this function i wrote to find prime numbers efficient
positive_passages.docid: 2378
positive_passages.text: Big O, how do you calculate/approximate it?
negative_passages.docid: 45793
negative_passages.text: How do you prove a number is prime?
negative_passages.docid: 7415
negative_passages.text: why only square root approach to check number is prime
negative_passages.docid: 7421
negative_passages.text: Fastest way to list all primes below N
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: 84879
negative_passages.text: Solving infinite sums with primes.
negative_passages.docid: 6266
negative_passages.text: Printing out Prime Numbers from 2 to 1000
negative_passages.docid: 107037
negative_passages.text: How to find prime numbers between 0 - 100?
negative_passages.docid: 75581
negative_passages.text: Is the sum of the first $n$ primes a prime infinitely many times?
negative_passages.docid: 126945
negative_passages.text: checking if a number is a prime
negative_passages.docid: 42841
negative_passages.text: Convergence of series involving the prime numbers
negative_passages.docid: 75378
negative_passages.text: how to prove this extended prime number theorem?
negative_passages.docid: 60706
negative_passages.text: Proof that there are infinitely many prime numbers starting with a given digit string
negative_passages.docid: 51059
negative_passages.text: Real-world applications of prime numbers?
negative_passages.docid: 131476
negative_passages.text: consecutive prime power
negative_passages.docid: 103796
negative_passages.text: How to find number of prime numbers between two integers
negative_passages.docid: 155452
negative_passages.text: Prime factorization of square numbers