Linked from

The 11 pages that link to Sieve of Eratosthenes, each with the reason it gives.

• Prime numberRelated: It efficiently lists primes by eliminating numbers with known prime divisors.

• Prime factorizationRelated: A precomputed list of primes speeds factorization by trial division.

• Prime-counting functionRelated: It computes exact values of π(x) for finite ranges.

• Fundamental theorem of arithmeticRelated: Knowing the primes makes systematic factorization and prime discovery possible.

• Prime gapsRelated: It is a standard way to compute consecutive primes and inspect their gaps.

• Composite numberRelated: The sieve marks composite numbers as multiples of smaller primes.

• Twin primeRelated: The sieve can identify twin-prime pairs among primes up to a chosen bound.