This is going to be a complete video lecture series on Number theory covering concepts in details with implementation details and practice problems to make concepts clear and gain confidence.
here are the list of topics we could be covering in this seires
(advance concepts like Mobius inversion and FFT will be covered in advanced number theory series).
L00 : Course Overview
L02 : Sieve of Eratosthenes
L04 : Binary Exponentiation
L07.1 : Fibonacci Finding (HackerRank) - Matrix exponentiation practice Problem
L08.1 : GCD Queries (Codechef)
L11 : Modular GCD(Codechef)
L10 : Introduction to modular inverse and how to calculate it
L11 : Extended Euclid algorithm
L12 : Solving Linear diophantine equation using extended Euclidean algorith
L13 : Calculating Binomial Coefficient
L14 : fiinding number of divisors of N
L15 : Chinese Remainder Theorem
L16 : Euler’s Totient Function
L17 : Pollard p-1 integer factorization method
L18 : Pollard Rho integer factorization method
L19 : Segmented Sieve
Your suggestion / support is needed for this channel(CodeNCode) to grow.
Thank you for your valuable time.