Company Logo

HinglishAdvanced

Number theory for Competitive Programming (Part 2)

Mar 22, 2021 • 55m

Avatar

Istasis Mishra

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.

HinglishAdvanced
Thumbnail

Similar Classes

More from Istasis Mishra

Similar Plus Courses

    COMPANY
  • About us
  • Careers
  • Blogs
  • Privacy Policy
  • Terms and Conditions
EDUCATOR APP
Play Store
App Store
warningNo internet connection