Theory of numbers: Congruences: Chinese remainder theorem @richarde.borcherds7998

Uploaded February 2021 | Updated September 2026, 2 weeks ago

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

We describe the Chinese remainder theorem, which can be used to reduce problems about congruences to problems about congruences modulo prime powers. We give a few applications, including a sharper version of Euler's theorem.

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

Theory of numbers: Congruences: Chinese remainder theorem

Modular forms: Fourier coefficients of Eisenstein series

Introduction to number theory lecture 10. Fermats theorem

Rings and modules 4 Unique factorization

Modular forms: Hecke operators for forms

Introduction to number theory lecture 33. Quadratic reciprocity