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.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |