Mar 22, 2021 • 55m
116K watch mins
In the last session, we learnt about some basic modular arithmetic, the euler phi function and the sieve of Eratosthenes. In this session, we will continue to build on our knowledge and learn how the GCD function works recursively, use the extended GCD algorithm to solve linear diophantine equations, Chinese Remainder Theorem and also the linear sieve and how to use the linear sieve to find any multiplicative function. Hopefully we will also learn about Mobius Inversion.
Starts on Nov 6, 2021 • 9 lessons