From charlesreid1

Revision as of 18:14, 29 March 2026 by Unknown user (talk) (→‎Computing Prime Numbers)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

List of Prime Numbers

A really big list of all the prime numbers less than 1 million: Prime Numbers/List

Computing Prime Numbers

Sieve of Eratosthenes

The Sieve of Eratosthenes is the most common algorithm for finding prime numbers below a certain value N.

Segmented Sieve

A segmented prime number sieve is an algorithm that can search for prime numbers that fall in a segmented range (finding prime numbers between M and N).

Flags