239 Reading Schedule

for Day
Reading
Presentations
August 28
Syllabus, to the Student, 1 - Joy 2 - Communication
(to the Student 2, 1.1)
August 30
3 - Definition
1, 7, 12
September 1
4 - Theorem
1, 2, 4
September 6
5 - Proof
3, 5, 9
September 8
6 - Counterexample
3, 5, 6
September 11
7 - Boolean Algebra
2, (one part per person),7
September 13
8 - Lists, 9 - Factorial
8.7, 13, 9.9, 10
September 15
10 - Sets I
1, 5, 6
September 18
11 - Quantifiers
1, 3, 4
September 20
12 - Sets:  Union, Intersection, and Sizes, Discuss Indexed Sets
3, 9
September 22
12 - Sets:  Differences and Products
6, 12, 15
September 25
Chapters I and II

September 27
Chapters I and II

September 29
First exam

October 2
14 - Relations
1, 4, 8
October 4
15 - Equivalence Relations
5, 7, 8
October 6
16 - Partitions
7, 9, 12
October 11
17 - Binomial Coefficients:  definition and calculating
4, 6, 16
October 16
17 - Binomial Coefficients:  Pascal's Triangle and formula
8, 11, 19
October 18
20 - Contrapositive
1, 2, 3
October 20
20 - Contradiction (Reductio ad Absurdum)
6, 8, 10
October 23
22 - Induction, Strong Induction
4 (one part per person), 10
October 25
22 - Long Induction Examples
6, 14
October 27
Chapters III and IV

October 30
Chapters III and IV

November 1
Second Exam

November 3 24 - Functions introduction
1 (parts (1) and (2)), 6
November 6
24 - Functions (inverse and rest)
7, 10, 13
November 8
25 - Pigeonhole Principle, Cardinality
1, 2 and 3, 10
November 10
26 - Composition
5, 6, 11
November 13
27 - Permutations
3, 5, 6
November 15
27 - Transpositions
1, 7, 11
November 17
35 - Dividing
2, 3, 7
November 20
36 - Euclidean Algorithm 1, 5, 6
November 27
36 - How fast and rest 2, 12, 16
November 29
37 - Modular Addition, Multiplication and Subtraction 1 a-m, 4, 9
December 1
37 - Modular Division 1n-q, 12, 13
December 4
39 - Fundamental Theorem of Arithmetic 3, 9, 10
December 6
39 - Infinitely Many Primes and onward 8, 13, 14
December 8
Chapter VII

December 11
Chapters I - V, VII
December 15
Chapters I - V, VII