1.Previous
3.Next

of contain a divisor less than or equal to , so the algorithm need only search for divisors less than or equal to to guarantee detection of all divisor pairs.

Also, 2 is a prime dividing 100, which immediately proves that 100 is not prime. Every positive integer except 1 is divisible by at least one prime number by the Fundamental Theorem of Arithmetic. Therefore the algorithm need only search for prime divisors less than or equal to .

For another example, consider how

1.Previous
3.Next