## Competitive Programming and Problem Solving 101

### Number Theory

- Euclidean Algorithm - Greatest Common Divisor
- Lowest Common Multiple of Two Number
- Primality Test - Naive Methods
- Sieve of Eratosthenes - Generating Primes
- Prime Number Theorem
- Prime Factorization of an Integer
- Introduction to Modular Arithmetic
- Extended Euclidean Algorithm
- Simple Hyperbolic Diophantine Equation
- Introduction to Number Systems
- Factorial
- Number of Digits of Factorial
- Prime Factorization of Factorial
- Number of Trailing Zeroes of Factorial
- Leading Digits of Factorial
- Modular Exponentiation
- Euler Totient or Phi Function
- Modular Multiplicative Inverse

Vaiya,why don't you write more?I'm reading your blog since yesterday.It's really very good :) I have learnt a lot of things :D

ReplyDeleteStarted learning NT from your blog and learning a lot of new things. Thanks for everything. :D And also requesting to write something on chinese remainder theorem. Thanks.

ReplyDeleteYour blog is amazing, it helped me a lot. I love One Piece too :)

ReplyDeleteExceelent Tutorial Sir

ReplyDelete