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