MA132 was identical to MA138 for the first 17 sections of the combined lecture notes (to end week 6).

1. Sets, subsets, power-sets. Functions, informally. Cantor's theorem and Russell's paradox.
2. Ordered pairs and cartesian products, Functions, formally. Operations on sets (union, intersection), operations on functions (composition).
3. Relations, equivalence relations, partitions. Quotients and the integers.  Well-defined functions.
4. Modular arithmetic. Boolean operators, truth tables, quantifiers.
5. Proof, informally and formally. How to write them and how to read them.
6. Recursion and induction. The well-ordering principle.


 From then on they diverged and covered the attached lecture notes.

Week 7: division with remainder, highest common factors and lowest common multiples, Euclid's Algorithm and the Fundamental Theorem of Arithmetic

Week 8: Chinese Remainder Theorem, modulo multiplication, Fermat's Little Theorem, Euler's Theorem and (time permitting) "Big O" notation

Week 9: algorithm running times (primality testing, Euclid's Algorithm), the Discrete Logarithm Problem, the Diffie-Hellman Problem, multiplication modulo prime numbers

Week 10: cryptography, roots modulo n, Wilson's Theorem, Miller-Rabin Primality testing, Diffie-Hellman key exchange, RSA Ciphers