Theory of numbers: Congruences: Euler's theorem @richarde.borcherds7998

Uploaded January 2021 | Updated September 2026, 2 weeks ago

This lecture is part of an online undergraduate course on the theory of numbers.

We prove Euler's theorem, a generalization of Fermat's theorem to non-prime moduli, by using Lagrange's theorem and group theory.

As an application of Fermat's theorem we show there are infinitely many primes with last digit 1.

For the other lectures in the course see youtube.com/playlist?list=PL8yHsr3EFj52Qf7lc3HHvHRdIysxEcj1H

Theory of numbers: Congruences: Eulers theorem

Modular forms: Theta functions in higher dimensions

Introduction to number theory lecture 3: Divisibility and Euclids algorithms.

Vinberg lecture part 4. Automorphic forms

Introduction to number theory lecture 13. The Chinese remainder theorem.

Introduction to number theory lecture 16. More numerical calculation

Introduction to number theory lecture 6. Multiplicative functions.

Introduction to number theory lecture 35 Jacobi symbol