January 23 
Course Intro



January 25 
Statements, Proofs, and Contradiction

1.1,
1.2,
1.8

January 28 
Intro to Set Theory

4.1,
5.1

January 30 
Set Equality & Quantification

1.7,
3.6

February 01 
Relations

4.2,
4.4,
9.11,
9.12

February 04 
Functions, Injectivity, Surjectivity, Bijections

4.2,
4.4,
9.11

February 06 
Equivalence Relation and Bijection Examples

4.3,
9.11,
9.12

February 08 
Induction

15.1,
6.1

February 11 
Induction Continued, Strong Induction

6.2,
6.3

February 13 
Intro to Number Theory

8.1

February 15 
Division Algorithm, Euclidean Algorithm

8.2,
8.3,
8.7

February 20 
Euclidean Algorithm, Backtracking, Modular Arithmetic, Multiplicative Inverse

8.2,
8.5,
8.6.1

February 22 
Multiplicative Inverse, Fermat’s little Theorem

8.6

February 25 
Multiplicative Inverse, Fermat’s little Theorem, Euler’s Phi Function

8.6,
8.7

February 27 
Message Passing, RSA Encryption

8.8

March 01 
Propositional Logic

3.1,
3.3,
3.4

March 04 
Snow Day



March 06 
Predicate Logic, Normal Forms (CNF, DNF), Boolean Algebra

3.1,
3.3,
3.4

March 08 
Intro to Circuits



March 11 
Fulladders, Feedback Circuits



March 13 
RS Latch, Clock Input



March 15 
Clock Input, D FlipFlop Circuit



March 18 
Intro to Counting

15.2,
15.3,
15.4,
15.5,

March 20 
Binomial Theorem, Pascal's Triangle, Inclusion/Exclusion

15.7

March 22 
No Class



April 01 
Inclusion/Exclusion

15.12

April 03 
Pigeonhole Principle

15.10

April 05 
Asymptotic Analysis

14.7

April 08 
Asymptotic Analysis continued; Mergesort

14.7,
21.2

April 10 
Graph Theory

11.1,
11.11

April 12 
Graph Theory; Prufer Codes; Graph Complexities



April 15 
Eulerian Circuits; Hamiltonian Cycles



April 17 




April 19 




April 22 




April 24 




April 26 




April 29 




May 01 




May 03 




May 06 




May 08 




May 10 



