## CPPS 101

# 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
- Modular Exponentiation
- Euler Totient or Phi Function
- Modular Multiplicative Inverse
- Chinese Remainder Theorem
- Multiplicative Function New!!
- GCD Sum Function New!!

## Combinatorics

- Stars and Bars Theorem
- Prufer Code
- Lucas Theorem – Proof and Applications New!!

## Contest Analysis

- Contest Analysis: IUT 6th National ICT Fest 2014, UVa 12830 – 12839
- Contest Analysis: BUET Inter-University Programming Contest – 2011, UVa 12424 – 12432