- Binary Exponentiation
- Compute x^n using only O(logn)
- Compute x^n mod m
- Euclidean algorithm for computing the greatest common divisor (GCD)
- Properties of GCD/LCM
- Linear Diophantine Equation
- Problem 1: https://www.spoj.com/problems/LASTDIG/
- Problem 2: https://www.spoj.com/problems/LOCKER/ ( Video Editorial available on the channel )
- Problem 3: https://www.spoj.com/problems/ZSUM/
- Problem 4: https://www.spoj.com/problems/CEQU/
- Problem 5: https://codeforces.com/contest/633/problem/A
- Problem 6: https://codeforces.com/problemset/problem/630/I