Discrete Mathematics II 1000-212aMD2

1. asymptotic notation, masters' theorem
2. elementary number theory: divisibility, gcd and Euclid algorithm, modular arithmetics and chinese remainder theorem
3. applications of number theory in cryptography: Miller-Rabin primality test and RSA public key cryptosystem
4. groups and Polya theory
5. condiditional probability, random variables, mean and variance
6. probability generating functions, probability inequalities
7. random walks, Markov chains
Prerequisites:
Fundamentals of combinatorics and graph theory, course 1000-211MD1