Prime Number Generator (Sieve of Eratosthenes)
Generate a list of all prime numbers up to any limit N.
How It Works
Enter a limit N. The Sieve of Eratosthenes eliminates multiples of each prime starting from 2, leaving only primes up to N.
Formula
Sieve of Eratosthenes: mark multiples of each prime as composite.
Frequently Asked Questions
How many primes are below 100?
There are 25 primes below 100: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97.
What is the Sieve of Eratosthenes?
It is an ancient algorithm that efficiently finds all primes up to N by iteratively marking multiples of each prime as composite.