Date	Topic	Reading	Remark
09/06	Introduction. Lecture: this homepage, and Preliminaries. Sets.
09/08	Functions, operations	3.1
09/13	Relations.
09/15	Asymptotic notation. Machine models, basic integer arithmetic	3.1, 3.2, 3.3.5
09/20	Divisibility and primality	1.1
09/22	Greatest common divisors and ideals	1.2, 1.3
09/27	Semigroups, groups, rings and counterexamples.
09/29	The Euclidean algorithm	4.1, 4.2
10/04	Congruences, basic properties. The ring of residue classes.	2.1, 2.3
10/06	Solving linear congruences. Chinese remainder theorem.	2.2	Friday: last day to drop without W.
10/11	Chinese remainder algorithm. Fractional reconstruction, error correction.	4.3, 4.5
10/13
10/18	Euler's phi function, Fermat's little theorem	2.4-5
10/20	Review
10/25	Midterm
10/27	Chebyshev's theorem	5.1	Friday: last day to drop with W.
11/01	Abelian groups	8.1-2
11/03	Cosets, homomorphisms	8.3-4
11/08
11/10	Cyclic groups	8.5	Friday: holiday (Veterans' Day)
11/15	Rings	9.1
11/17	Polynomials	9.2
11/22
11/24	Fall recess
11/29	Ideals, quotient rings, homomorphism	9.3-4
12/01	Polynomial arithmetic	17.3-4
12/06
12/08	Last class
12/16	Final exam 9:00-11:00