1/17 T |
1.1: Statements and Truth Tables |

1/19 R |
1.2: Quantifiers |

1/20 F |
1.3: de Morgan's Laws |

1/24 T |
1.4: Mixed Quantifiers |

1/26 R |
1.5-6: Logic, Sets, Families of Sets |

1/27 F |
1.7: Equivalence Relations |

1/31 T |
2.1: Introduction to Proof |

2/2 R |
2.2 Divisibility and Existence Proofs |

2/3 F |
2.3-4 More on Existence Proofs, Inroduction to Induction |

2/7 T |
2.5: More on Mathematical Induction, the Binomial Theorem |

2/9 R |
Review for Exam 1 |

2/10 F |
EXAM 1 |

2/14 T |
2.6: Strong Induction |

2/16 R |
2.7: Well-Ordering Property |

2/17 F |
2.8: Indirect Proof |

2/21 T |
3.1-2: Congruence and Modular Addition |

2/23 R |
3.3: The Euclidean Algorithm |

2/24 F |
3.4: Modular Multiplication |

2/28 T |
3.5: GCD's and LCM's |

3/1 R |
3.6: The Fundamental Theorem of Arithmetic |

3/2 F |
3.7: Wilson's and Euler's Theorems |

3/6 T |
4.1-2: Introduction to Functions, Functions on Sets |

3/8 R |
Review for Exam 2 |

3/9 F |
EXAM 2 |

3/27 T |
4.3-4: One-to-one and Onto Functions |

3/29 R |
4.5: PseudoInverses |

3/30 F |
4.6: Injections and Surjections |

4/3 T |
4.7: Cardinality and Countability |

4/5 R |
4.8: To Infinity...And Beyond! |

4/6 F |
The Continuum Hypothesis |

4/10 T |
Undergraduate Conference |

4/12 R |
Review for Exam 3 |

4/13 F |
EXAM 3 |

4/17-4/20 |
Graph Theory |

4/24-4/27 |
Abstract Algebra |

5/1-5/4 |
Real Analysis and Topology |

5/8 |
Course Recap-Final Exam Review |