One method for finding prime numbers is the sieve of Eratosthenes. The natural
numbers from 2 to 50 are shown in the table. Start at the number 2 (the
smallest prime number). Leave the number 2 and cross out every sccond number
after the number 2. This will climinate all numbers that are multiples of 2.
Then go back to the beginning of the chart and leave the number 3 , but cross
out every third number after the number 3 (thus eliminating the multiples of 3
). Begin at the next open number and continue this process. The numbers that
remain are prime numbers. Use this process to find the prime numbers less than
50 .
$$\begin{array}{c|c|c|c|c|c|c|c|c|c}
& 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 \\
\hline 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 \\
\hline 21 & 22 & 23 & 24 & 25 & 26 & 27 & 28 & 29 & 30 \\
\hline 31 & 32 & 33 & 34 & 35 & 36 & 37 & 38 & 39 & 40 \\
\hline 41 & 42 & 43 & 44 & 45 & 46 & 47 & 48 & 49 & 50 \\
\hline
\end{array}$$