In this step, 49 is the only remaining multiple of 7 that is eliminated from the table. Step 5: Repeat Step 2, circle the next smallest number 7 in the list, and cross all the multiples of 7.

The multiples of 5 that are eliminated from the table are 25 and 35. Step 4: Repeat Step 2, circle the next smallest number 5 in the list, and cross all the multiples of 5. The multiples of 3 that are eliminated from the table are: 9,15,21,27,33,39, and 45. Step 3: Repeat Step 2, circle the next smallest number 3 in the list and cross all the multiples of 3. We start with 2 because the number 1 is not a prime number. This will eliminate all the even numbers (which are multiples of 2), and are not prime as they have more than 2 factors.The multiples of 2 that are eliminated from the table are as follows: 4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,44,46,48, and 50. Step 2: Circle the smallest number which is 2 in the table. Step 1: Make a table of 5 rows and 10 columns starting with 1 and continuing until 50, as shown below. The Sieve of Eratosthenes algorithm is used as shown in the following steps. In order to find the prime numbers from 1 to 50, we can use the Sieve of Eratosthenes algorithm as this algorithm helps us to list all prime numbers quickly, up to a given number. Condition 3: n should be divisible by n itself.Condition 2: n should be divisible by 1.Condition 1: n must be a positive Integer.In order to check if any number 'n' is prime or not, we need to follow 3 conditions. A prime number has exactly two factors and hence it cannot be broken down further into a product of two natural numbers other than 1 and itself.

List all prime numbers from 1 to 100