![]() 990,368,329 visitors served. |
|
![]() Dictionary/ thesaurus | ![]() Medical dictionary | ![]() Legal dictionary | ![]() Financial dictionary | ![]() Acronyms | ![]() Idioms | ![]() Encyclopedia | ![]() Wikipedia encyclopedia | ? |
Eratosthenes' sieve |
Also found in: Encyclopedia, Wikipedia | 0.03 sec. |
Eratosthenes' sieveMethod for finding prime numbers. It involves writing in sequence all numbers from 2. Then, starting with 2, cross out every second number (but not 2 itself), thus eliminating numbers that can be divided by 2. Next, starting with 3, cross out every third number (but not 3 itself), and continue the process for 5, 7, 11, 13, and so on. The numbers that remain are primes. |
|
? Mentioned in |
|---|
| Free Tools: |
For surfers:
Browser extension |
Word of the Day |
Help
For webmasters: Free content NEW! | Linking | Lookup box | Double-click lookup | Partner with us |
|
|---|