query: finding big oh for prime algorithm
positive_passages.docid: 142904
positive_passages.text: finding the running time for my algorithm for finding whether an input is prime in terms of the input
negative_passages.docid: 75733
negative_passages.text: Divisibility of prime numbers
negative_passages.docid: 50128
negative_passages.text: Efficiently finding two squares which sum to a prime
negative_passages.docid: 130244
negative_passages.text: Exercise similar to prime avoidance theorem in R.Y. Sharp's textbook
negative_passages.docid: 103323
negative_passages.text: Finding a primitive root of a prime number
negative_passages.docid: 108806
negative_passages.text: Sum of prime numbers below 2,000,000 giving wrong result
negative_passages.docid: 146066
negative_passages.text: Fastest way to find if a given number is prime
negative_passages.docid: 115454
negative_passages.text: Primality test bound: square root of n
negative_passages.docid: 12374
negative_passages.text: Approximation to the prime counting function
negative_passages.docid: 4100
negative_passages.text: What is a plain English explanation of "Big O" notation?
negative_passages.docid: 63893
negative_passages.text: Prime dividing the binomial coefficients
negative_passages.docid: 51059
negative_passages.text: Real-world applications of prime numbers?
negative_passages.docid: 73515
negative_passages.text: Primes Number Theory
negative_passages.docid: 91565
negative_passages.text: How to efficiently compute $\,25^{37}\pmod{55}$?
negative_passages.docid: 2378
negative_passages.text: Big O, how do you calculate/approximate it?
negative_passages.docid: 112599
negative_passages.text: What is the smallest value of n such that an algorithm running at 100*n^2 operates faster than 2^n ? [How to figure out without brute force]
negative_passages.docid: 95033
negative_passages.text: Find the remainder of a number with a large exponent