Theory of numbers: Congruences: Chinese remainder theorem
Channel: Richard E Borcherds
Date: 2021-02-01

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 https://www.youtube.com/playlist?list=PL8yHsr3EFj52Qf7lc3HHvHRdIysxEcj1H