Art of the Problem | Primality test using a sieve (Prime Adventure part 5) @ArtOfTheProblem | Uploaded 11 years ago | Updated 11 hours ago
An attempt at an optimal trial division primality test using the Sieve of Eratosthenes. We visualize the time complexity of storing all primes up to square root of n and then testing each one. Finally we ask: why can't we just store a precomputed list of primes in memory?