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.
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.
Lecturers
2Each in their own terms, from the easiest level.
Terence Tao
A classic algorithm that lets one capture all prime numbers between the square root of and by successively eliminating multiples of primes.
Connections
5The lectures that define it or assume it, and the concepts next to it.