The Sieve of Eratosthenes: The algorithm is used to find (identify) the prime numbers in a list. Tip: start by crossing out the multiples of the smaller primes

What is a prime number? Definition, examples

What is a composite number? Definition, examples

The prime numbers up to 1,000

The prime numbers up to 10,000

The Sieve of Eratosthenes

The Euclidean Algorithm

Completely reduce (simplify) fractions to the lowest terms: Steps and Examples