Systerms : system terms : Sieve of Eratosthenes

A (14) | B (13) | C (18) | D (12) | E (7) | F (17) | G (6) | H (8) | I (5) | J (2) | K (2) | L (2) | M (10) | N (4) | O (2) | P (20) | Q (2) | R (16) | S (30) | T (9) | U (8) | V (5) | W (6) | X (1) | Y (1) | Z (1) | Π (1) | Φ (1)

The Sieve of Eratosthenes is an ancient algorithm for quickly finding all prime numbers within a certain range, proposed by the Greek mathematician Eratosthenes.

Search