Link to current version of calendar.
A preliminary calendar is below. Note that exam dates and homework assignments are tentative, and will be confirmed as the dates approach. Your first homework assignment is:
Homework #1, due next Tuesday 9/1
Sec 1.1: 1, 12, 19, 26, 29, 35
| Day | Date | Topic | Homework (TENTATIVE) |
| 1 | 8/27/2015 | Sec 1.1: Sets | Sec 1.1: 1, 12, 19, 26, 29, 35 |
| 2 | 9/1/2015 | Sec 1.2, 1.3: Cartesian Products, Subsets | (Webwork 1) |
| 3 | 9/3/2015 | Sec 1.4, 1.5, 1.6, 1.7: Set operations | (Webwork 2) |
| 4 | 9/8/2015 | Sec 1.7, 1.8, 2.1: Collections of sets | Sec 1.8: 3, 5, 6, 8 |
| 9/10/2015 | MONDAY SCHEDULE | ||
| 9/15/2015 | NO CLASSES SCHEDULED | ||
| 5 | 9/17/2015 | Sec 2.1, 2.2, 2.3: Statements (and, or, not, if) | (Webwork 3) |
| 9/22/2015 | NO CLASSES SCHEDULED | ||
| 6 | 9/24/2015 | Sec 2.4, 2.5, 2.6: Biconditional, Truth tables, Logical equivalence | (Webwork 3) |
| 7 | 9/25/2015 | NOTE: CLASSES FOLLOW TUESDAY SCHEDULE Sec 2.7, 2.8, 2.9, 2.10, 2.11: Quantifiers, Translation, Negation |
(Webwork 4) |
| 8 | 9/29/2015 | Sec 3.1, 3.2: Lists, factorials | (Webwork 5) |
| 9 | 10/1/2015 | EXAM 1 (through 2.6) | |
| 10 | 10/6/2015 | Sec 3.3. 3.4: Counting subsets, Binomial Theorem (Chapter 4: Direct Proof) |
(Webwork 6) |
| 11 | 10/8/2015 | Chapter 4: Definitions, Basic facts | |
| 12 | 10/13/2015 | Chapter 4: Direct proof | Chapter 4 p.100: 1, 6, 15, 16 |
| 13 | 10/15/2015 | Chapter 5: Contrapositive Proof | Chapter 5 p.110: 1, 4, 20 |
| 14 | 10/20/2015 | Chapter 6: Proof by contradiction | Chapter 6 p.116: 3,4,5,8,9 |
| 15 | 10/22/2015 | EXAM 2 (through Chapter 5) (midsemester grades due) |
|
| 16 | 10/27/2015 | Chapter 7: If-and-only-if proofs; existence proofs | Chapter 7 p129: 5, 9, 10, 12 |
| 17 | 10/29/2015 | Chapter 8: Proofs involving sets | Chapter 8 p143: 3, 7, 18, 19 |
| 18 | 11/3/2015 | Chapter 9: Disproof | Chapter 9 p152: 3, 4, 5 |
| 19 | 11/5/2015 | Chapter 10: Induction (introduction) | Chapter 10 p167: 1, 2, 10, 15 |
| 20 | 11/10/2015 | Chapter 10: Induction (examples) | |
| 21 | 11/12/2015 | Chapter 10: Strong Induction, proof by minimum counterexample | Chapter 10 p167: 25, 28 (extra credit: 30) |
| 22 | 11/17/2015 | Sec 11.0, 11.1: Relations and their properties | Section 11.0 p178: 3,4 (Webwork 7) |
| 23 | 11/19/2015 | Sec 11.2, 11.3, 11.4: Equivalence relations and partitions, Integers modulo n real numbers, graph theory |
Sec 11.2 p187: 1,2,7 In addition, complete Example 11.8 at the top of p182. |
| 24 | 11/24/2015 | EXAM 3 (through Sec 11.1) | |
| 11/26/2015 | COLLEGE CLOSED | ||
| 25 | 12/1/2015 | Sec 11.5, 12.1, 12.2, 12.4: Relations between sets, Functions, Injective and surjective functions , Composition of Functions | Sec 12.1 p200: 1,3,7,10 Sec 12.2 p204: 1,7,8 Sec 12.4 p210: 3, 7, 10 |
| 26 | 12/3/2015 | Sec 12.3: The pigeonhole principle | Sec 12.3 p207: 1 |
| 27 | 12/8/2015 | Sec 12.5, 12.6: Inverse functions, image and preimage | Sec 12.5 p214: 2, 6 Sec 12.6 p216: 1, 2 |
| 28 | 12/10/2015 | Sec 13.1: Cardinality | Sec 13.1 p222: 1, 4, 5 |
| 29 | 12/15/2015 | Sec 13.2: Countable and uncountable sets Sec 13.3: Comparing Cardinalities |
none |
| 30 | 12/17/2015 | FINAL EXAM |
