Section 16.7 Check Point Questions2 questions 

Prove that if n is not prime, there must exist a prime number p such that p <= sqrt(n) and p is a factor of n.

Describe how the sieve of Eratosthenes is used to find the prime numbers.