Primes: Fundamental Theorem and Sieve of Eratosthenes

This lecture covers the definition of primes and composites, the Fundamental Theorem of Arithmetic stating that any integer greater than 1 can be written as a product of primes, the proof of this theorem using strong induction, trial division for composite integers, the Sieve of Eratosthenes for finding primes, and Euclid's Theorem proving the infinitude of primes.