4 ms·
Technically yes, however it would be strictly worse than even a simple Sieve of Eratosthenes in accuracy, memory footprint, and speed. Attempting to automatica
by Nasrudith 9y ago
Technically yes, however it would be strictly worse than even a simple Sieve of Eratosthenes in accuracy, memory footprint, and speed.
Attempting to automatically discover proofs that constrain the prime number search space would be more likely to be useful in that domain.