Notera

Sieve of Eratosthenes

High School

Formula

p is prime  ⟺  ∄ d∈(1,p):d∣pp \text{ is prime} \iff \nexists\, d \in (1,p) : d \mid p

About

The Sieve of Eratosthenes is one of the oldest known algorithms for finding all prime numbers up to a given limit. It works by iteratively marking the multiples of each prime number starting from 2. Watch as composite numbers are eliminated and primes emerge.

Controls

Primes found: 0
Limit100
Speed100ms