Approximate Schedule.
7/11 Euclidean Division Algorithm, Greatest Common Divisor, Mathematical Induction.
(Read Ch 1.1, 1.2);
7/13 Prime numbers, Unique factorisation.
7/14 Congruences.
7/18 Linear Congruences, Fermat's Theorem. (Homework 1 due)
7/20 Euler's Theorem and applications.
7/21 Public key cryptography and Cryptographic protocols.
7/25 Sets, functions. (Homework 2 due)
7/27 Relations, Permutations.
7/28 Permutations.
8/ 1 Order and SIgnature of a Permutation.(Homework 3 due)
8/ 3 Order and Signature of a Permutation.
8/ 4 Transpositions and cycles
8/ 8 Groups, definition and examples. (Homework 4 due)
8/10 Algebraic structures. Order of an element.
8/11 Generators, Subgroups.
8/15 Lagrange's Theorem, Finite groups of small order. (Homework 5 due)
8/17 Review for final
8/18 FINAL EXAMINATION