. We will be working at the pace of approximately one section per day

Assignments

8/31 W	1.1: Statements and Truth Tables	1, 2 (a,c), 4, 5
9/2 F	1.2: Quantifiers	1, 2, 3, 4, 5
9/5 M	1.3:De Morgan’s Laws	2,3,4,5,7
9/7 W	1.4: Mixed Quantifiers and Definitions	1, 2(ab), 4, 5
9/9 F	1.5: Sets, Unions, and Intersections	1, 2,5,8,9
9/12 M	1.6: Families of Sets, Power Sets	2,3,4, 7,8,9
9/14 W	1.7 Equivalence Relations	1,2,3,6,7,8 (Due Monday)
9/16 F	1.7, 2,1 Intro to Proofs	HW TBA
9/19 M	1.7, 2,1 Intro to Proofs	HW 2.2: 2,4,5,7,8,9 (Due 9/28)
9/21 W	1.7, 2,1 Intro to Proofs	Review for Exam 1
9/23 F	EXAM 1
9/26 M	2.2 Existence Proofs, The Divisor Game	HW 2.3: 2,3,6,8,9,12 (Due 9/30)
9/28 W	2.3 Induction Proofs	HW 2.4: 2,3,5,6,7,12,13,14
9/30 F	More on Induction	(It is that important!)
10/3 M	2.5 Pascal’s Triangle and the Binomial Theorem	HW 2.5: 3, 5, 8, 10, 12 (Due 9/30)
10/5 W	2.5: The Arithmetic-Geometric Mean Inequality
10/10 M	2.6 Strong Mathematical Induction and the Fundamental Theorem of Arithmetic	HW 2.6: 1,2,3,4,6
10/12 W	2.6: Number Sequences and Induction: The Fibonacci Numbers
10/13, R	2.7 Well Ordering Principle	HW 2.6 5dghi, 2.7: 1,
10/14 F	More on Induction	(It is that important!)
10/17 M	2.8 Indirect Proofs, Proofs by Contradiction
10/19 F	Wrap up of Ch 2, Exam 2 Review
10/20 R	Exam 2
10/24 M	3.1 Congruences and Modular Arithmetic	HW: 1,3,4,5,6,7,8,9,12
10/26 W	3.2: The Space Z(n)	HW: 4, 5, 6, 7, 8, 9, 10
10/28 F	3.3: The Euclidean Algorithm	HW: 1 (enough to become familiar with the Euclidean Algorithm), 2, 6, 7, 9, 10, 12 (Due Monday, 10/31)
10/31 M	3.4: The Spaces U(n)	HW: 4,5,6,9,12,15 (Due Wednesday, 11/2)
11/2 W	3.5: The GCD and the LCM	HW: 2,5,6,8,9,10 (Due Friday, 11/4)
11/3 R	The Fundamental Theorem of Arithmetic	HW: 1,2,3,7,10,12,13,14,15