> "It works by testing whether each integer is divisible by any smaller integer, apart from itself and 1. This is similar in principle to the Sieve of Eratosthenes."
How is this anything close the the Sieve? The Sieve is forward looking eliminating number that are multiples of a found prime, forward looking and eliminating. This, from the description, is just the classic prime test of looking at all smaller numbers to find divisors.
How is this anything close the the Sieve? The Sieve is forward looking eliminating number that are multiples of a found prime, forward looking and eliminating. This, from the description, is just the classic prime test of looking at all smaller numbers to find divisors.