To construct a table of all prime numbers less than ''n'', you can use a method called the [[Sieve of Eratosthenes]]. Simply write down an ordered list of all counting numbers from 1 to ''n''. Beginning with 2*2 = 4, cross out every second number: | To construct a table of all prime numbers less than ''n'', you can use a method called the [[Sieve of Eratosthenes]]. Simply write down an ordered list of all counting numbers from 1 to ''n''. Beginning with 2*2 = 4, cross out every second number: |