Sign inSign in
ConceptMathematics

Sieve of Eratosthenes

An algorithm for finding all prime numbers up to a given limit by iteratively crossing out multiples of each prime found.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Prime number2Divisibility1Integer1Multiples1Square roots1

Lecturers

2

Each in their own terms, from the easiest level.

  • Terence Tao

    UCLA · Introductory

    A classic algorithm that lets one capture all prime numbers between the square root of NN and NN by successively eliminating multiples of primes.
    • 34:14Structure and Randomness in the Prime Numbers

Connections

5

The lectures that define it or assume it, and the concepts next to it.

Concepts3

Lectures2

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.