Theory of numbers: Fundamental theorem of arithmetic @richarde.borcherds7998
Theory of numbers: Fundamental theorem of arithmetic  @richarde.borcherds7998
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
Theory of numbers: Fundamental theorem of arithmeticZermelo Fraenkel Separation and replacementRings and modules 1 IntroductionRings 8 Free modulesComplex analysis: IntegrationGalois theory: Artin Schreier extensionsComplex analysis: Summing seriesIntroduction to number theory lecture 22. Chevalley-Warning theoremCategories 2:  FunctorsIntroduction to number theory lecture 29. Rings in number theoryElliptic functions 1. Weierstrass function.Galois theory: Transcendental extensions
Richard E Borcherds |

Theory of numbers: Fundamental theorem of arithmetic

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER