Leader: Associate Professor Hans Lausch
Clayton Second semester 2006 (Day)
Synopsis: Groups in geometry, linear algebra, and number theory; cyclic and abelian groups; permutation groups; subgroups, cosets and normal subgroups; homomorphisms, isomorphisms and the fundamental homomorphism theorem. The euclidean algorithm, prime factorisation, congruences, the Euler totient function; the theorems of Fermat, Euler and Wilson, and the RSA public key cryptosystem; Chinese remainder theorem; rings, fields and abelian groups in number theory.
Assessment: Examination (3 hours): 70% + Assignments and tests: 30%
Contact Hours: Three 1-hour lectures and an average of one 1-hour support class per week
Prerequisites: MTH1030 or equivalent
Prohibitions: MTH2121, MTH3121, MTH3122