| Sep. 3 |
|
introduction |
| Sep. 5 |
DME: 2.1, 2.2, 2.5, 2.6 |
sets |
| Sep. 8 |
DME: 2.3, 2.4, 2.7, 2.8 |
subsets and power set |
| Sep. 10 |
MR: pgs. 1-10, 33-37, short article on Moodle |
math statements, and/or/not |
| Sep. 12 |
MR: 2.4 |
quantifiers |
| Sep. 15 |
DME 12.1-12.3, MR 82-83 |
set containment, divisibility |
| Sep. 17 |
MR 16-24 |
proving conditional statements |
| Sep. 19 |
MR 25-27, 85-91, 94-95 |
writing good proofs, contrapositive, or statements |
| Sep. 22 |
-- |
contradiction, more proof examples |
| Sep. 24 |
MR 141-147, 414-418 |
division algorithm, well ordering, gcd |
| Sep. 26 |
-- |
Mountain Day! |
| Sep. 29 |
MR 419-423 |
Euclidean algorithm |
| Oct. 1 |
MR 281-295, 297-302, 307-311 |
functions, injective, surjective |
| Oct. 3 |
MR 312-317, 323-330 |
bijection and composition |
| Oct. 6 |
MR 334-344, 92-93 |
inverses |
| Oct 8 |
DME 17.1-17.3 |
equivalence relations |
| Oct 10 |
-- |
Exam 1 |
| Oct 15 |
recap DME 17.1-17.3, read MR 147-149 |
modular arithmetic |
| Oct 17 |
P&C 151-160 |
induction |
| Oct 20 |
P&C 8.3 |
more induction |
| Oct 22 |
DME 6.9 |
pigeonhole |
| Oct 24 |
P&C 9.2 |
more pigeons! |
| Oct 27 |
DME 6.1-6.3 |
core counting techniques |
| Oct 29 |
DME 6.4 |
permutations |
| Oct 31 |
DME 6.5 |
combinations |