Lecture 1;  9/8 R;  CEL;  Administrivia, Proofs, Logic, Rigor
--PS1 out

Rec 1; 9/9; Proofs, Logic, Rigor

Tut 1; 9/12; PS1 due, PS2 out

Lecture 2;  9/13 T;  CEL;  Induction

Lecture 3;  9/15 R;  CEL;  Induction, Loop invariants, recursive defs

Rec 2; 9/16; Proofs, Induction

Tut 2; 9/19; PS2 due, PS3 out

Lecture 4;  9/20 T;  CEL;  Set Theory, Relations, Proofs

Lecture 5;  9/22 R;  CEL;  Graphs, Proofs

Rec 3; 9/23; Partial orders (?), Proofs

Tut 3; 9/26; PS3 due, PS4 out

Lecture 6;  9/27 T;  FTL;  Functions, In/sur/bijections, Cardinalities,
				Pigeonhole principal, proofs

Lecture 7;  9/29 R;  FTL;  Infinities, countability, def of discrete math,
				composition and inverse of functions, special
				functions: floors, x!, etc., proofs

Rec 4; 9/30; review of Taylor series, bounding sums with integrals, calculus,
				l'Hospital's rule, exact methods for sums

Tut 4; 10/3; PS4 due, PS5 out

Lecture 8;  10/4 T;  FTL;  Growth of functions: logarithmic, polynomial, 
				exponential, log*, etc., Asymptotic notation,
				Stirling's formula

Lecture 9;  10/6 R;  FTL;  Linear recurrences (homogeneous)

Rec 5; 10/7; Inhomogeneous linear recurrences
--PS5 due, Practice exam out

Tut 5; HOLIDAY

Lecture 10;  10/13 R;  FTL; Nonlinear recurrences, basic methods, merge sort
(perhaps sorting networks instead of sorting algorithms?)