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)
L16 : Euler’s Totient Function
L21 : ETF & GCD Sum Part 2
L21 : Solving Linear diophantine equation using extended Euclidean algorithm
L22 : Chinese Remainder Theorem
L23 : Pollard p-1 integer factorization method
L24 : Pollard Rho integer factorization method
L25 : Extended Euclid algorithm
Your suggestion / support is needed for this channel(CodeNCode) to grow.
Thank you for your valuable time.