Uploaded January 2021 | Updated November 2026, 3 days ago
This lecture is part of an online undergraduate course on the theory of numbers.
We use Euclid's algorithm to prove the fundamental theorem of arithmetic, that every positive number is a product of primes in an essentially unique way.
We then use this to prove Euler's product formula for the Riemann zeta function.
For the other lectures in the course see youtube.com/playlist?list=PL8yHsr3EFj52Qf7lc3HHvHRdIysxEcj1H
This lecture is part of an online undergraduate course on the theory of numbers.
We use Euclid's algorithm to prove the fundamental theorem of arithmetic, that every positive number is a product of primes in an essentially unique way.
We then use this to prove Euler's product formula for the Riemann zeta function.
For the other lectures in the course see youtube.com/playlist?list=PL8yHsr3EFj52Qf7lc3HHvHRdIysxEcj1H










