Prime Number Finder   Javascript Programming Edition

Use the Sieve of Eratosthenes to find Prime Numbers

The Sieve of Eratosthenes is a simple, ancient algorithm for finding all prime numbers up to a specified integer. The Sieve of Eratosthenes was created in the 3rd century BC by Eratosthenes, an ancient Greek mathematician.

Sieve of Eratosthenes Prime Numbers

Enter a number for the end of the range of primes you want to find, for example 100.

Enter the limit of the search: