Discrete mathematics with algorithms

Part 1 Sets and algorithms - an introduction: binary arithmetic and the magic track revisited algorithms set theory and the magic trick set cardinality and counting. Part 2 Arithmetic: exponentiation: a first look three inductive proofs how good is fast exponentiation? - the "big oh" notation. Part 3 Arithmetic of sets: binomial coefficients permutations the binomial theorem. Part 4 Number theory: greatest common divisors the Euclidean algorithm Fibonacci numbers congruences and equivalence relations an application - public key encryption schemes. Part 5 Graph theory: building the LAN graphs threes and the LAN graphical highlights. (Partial contents).