IMPORTANT NOTE:The following schedule represents my current best guess concerning due dates (and everything else). I am providing this information to give you a general idea of the pace and timing of the class. THESE DATES MAY CHANGE. Please do not depend upon this schedule in purchasing airline tickets or making other irrevocable scheduling decisions without consulting me first.

SCHEDULE

Refresh this page fairly often


Skip directly to Week 1 | Week 2 | Week 3 | Week 4 | Week 5 | Week 6 | Week 7 | Week 8 | Week 9 | Week 10| Week 11

DAY TOPIC READING
(Do before class)
Assign. Out Assign. In
M1 Intros, Syllabus, Intro to Proof
HW A
Start HW #1

W1 Proof Methods 1.1 - 1.9
(It's a lot, but try to do as much as you can)
HW #1 HWA
F1 Well-Ordering Principle 2.1-2.4
M2 Logic and Propositions 3.1-3.5 HW1
W2 Propositions and Equivalences
In-class exercises
3.3 Start on HW 2 (Chapter 2, Section 3.1)

F2 Quantifiers and Predicates 3.6 HW 2
M3 (More with) Proofs with Propositions and Predicates
In-class exercises
3.4
W3 Work on problems/Review for exam
See Moodle for a practice exam
4.1
F3 EXAM 1 (During class time)

M4 Sets 4.1 HW 3
W4 Sequences, Functions Sections 4.2, 4.3
F4 Binary Relations, Equivalence Relations Section 4.4, and additional readings from Rosen, found on Moodle HW #4 HW 3
M5 Induction Sections 5.1, 5.2
Work on Problems 5.3 and 5.5 from the text to go over in class on Wednesday
W5 Strong Induction Sections 5.2, 5.3,
F5 No Class - Midquarter Break   HW 4
M6 Recurrence Relations Reading on Moodle
HW #5
W6 Divisibility, GCDs, Prime Factorization 9.1-9.4 (skim over 9.3)
F6 Modular Arithmetic 9.5 - 9.7 Begin to work on Project 1: Relations and Databases. See Moodle for reading and full details.
HW 5
M7 Modular arithmetic, Inverses 9.6-9.9 (9.8 optional, but interesting) Problems to try as part of review: 9.4, 9.5, 9.9, 9.10, 9.12, 9.24
See Moodle for practice exam 2
W7 Review for Exam
F7 EXAM 2 (During class time)
M8 Euler's Theorem, RSA 9.10, 9.11 PP #1
W8 SEE MONDAY 8 10.1-10.2, 10.5, 12.1-12.3 Project 2: RSA
F8 Intro to Graph Theory, Isomorphisms, Bipartite Graphs, Coloring and Connectivity
Graph Theory Definitions
10.1-10.2, 10.5, 12.1-12.10 HW #6
M9 Walks, Paths, Cycles, Coloring, Connectivity
In-class exercises
Additional In-class exercises
Finish reading sections in Chapter 12
W9 Counting, Subsets, Repetition, Binomial Theorem 15.1-15.6 HW 6
F9 Poker, Pigeonhole, Inclusion-Exclusion 15.7-15.10
M10 Probability
In-Class Exercises
17.1-17.5
W10 Conditional Probability 18.1-18.3
F10 Course Wrap-up and review


M11 Final Exam: MWF 1:20, Monday, 11/19, 6:30pm - 9:00 pm

All work
due