Sieve of Eratosthenes
Uploaded by
Vinisha NishaSieve of Eratosthenes
Uploaded by
Vinisha NishaSieve of Eratosthenes
A mathematician, Eratosthenes (276-195 BC),devised a method known as the Sieve of Eratosthenes to find all the prime numbers in a given range of whole numbers. The following procedure describes how we can find all the prime numbers between 2 to 100 using the Sieve of Eratosthenes; Step 1 List all the whole numbers between 2 to 100 in order on a piece of plain paper. Step 2 Look for the first prime number, that is 2. Keep 2 and cross out all the multiples of 2. Note that the multiples of prime number are not prime numbers. Step 3 Look for the next prime number, that is 3. Keep 3 and cross out all the multiples of 3. the process is repeated until there are no more multiples to be crossed out. All the numbers left are prime numbers between 2 to 100.
1 11 21 31 41 51 61 71 81 91
2 12 22 32 42 52 62 72 82 92
3 13 23 33 43 53 63 73 83 93
4 14 24 34 44 54 64 74 84 94
5 15 25 35 45 55 65 75 85 95
6 16 26 36 46 56 66 76 86 96
7 17 27 37 47 57 67 77 87 97
8 18 28 38 48 58 68 78 88 98
9 19 29 39 49 59 69 79 89 99
10 20 30 40 50 60 70 80 90 100
