Schedule
This schedule is tentative and subject to change.
Warmups are due every class day, even if they are not listed under the “Due” column.
Week 1
M Sep. 08 |
Welcome! | ||||||
We discuss the structure of the course and the role of mathematics in modern computation. | |||||||
Learning Objectives Getting Oriented |
In Class Welcome! |
Due Entrance Survey, Student Hours Scheduling Poll |
|||||
W Sep. 10 |
Mathematics and Me | ||||||
We discuss our relationship to math, how we've learned what we've learned, and the role of generative AI in learning mathematics. | |||||||
Learning Objectives Getting Oriented |
Prep Math Autobiography |
In Class Mathematics and Me |
|||||
F Sep. 12 |
Lab 1: Technical Writing and Truth Tables | ||||||
We review truth tables for describing logical operations and begin our first lab assignment in Google Colab. | |||||||
Prep Statements and Truth Tables |
In Class Lab 1: Technical Writing and Truth Tables |
Week 2
M Sep. 15 |
More Logic: Equivalence, Conditionals, and Biconditionals | ||||||
We introduce formal manipulations of logical expressions and work with the many ways to manipulate conditional statements. | |||||||
Prep More Logic: Equivalence, Conditionals, and Biconditionals |
In Class Logic practice |
||||||
W Sep. 17 |
Introducing Set Theory | ||||||
We introduce sets, set-builder notation, and operations for combining and measuring sets. | |||||||
Learning Objectives S1, S2 |
Prep Introducing Set Theory |
||||||
F Sep. 19 |
Lab 2: Inclusion-Exclusion | ||||||
We use the inclusion-exclusion formula and its generalizations to compute the cardinality of unions of sets. Along the way, we practice writing mathematical computations and performing computational experiments. | |||||||
Learning Objectives S2 |
Prep Cardinality and Complements |
In Class Lab 2: Inclusion-Exclusion |
Due Lab 1: Technical Writing and Truth Tables |
Week 3
M Sep. 22 |
Quantifiers and Predicate Logic | ||||||
We discuss quantification of propositions over sets and how to apply logical operations to symbolic quantifiers. | |||||||
Learning Objectives L1, L2 |
Prep Quantifiers and Predicate Logic |
In Class Quantifiers In Mathematical Statements |
|||||
W Sep. 24 |
Logical Deduction | ||||||
We introduce logical deduction as a formal method for drawing conclusions from a set of premises. | |||||||
Learning Objectives L3 |
Prep Logical Deduction |
||||||
F Sep. 26 |
Quiz 1 | ||||||
The first of four quizzes in which students have an opportunity to complete Learning Targets. | |||||||
Due Lab 2: Inclusion-Exclusion |
Week 4
M Sep. 29 |
Direct Proof and the Element Method | ||||||
We introduce direct proofs, our first general technique for proving statements about mathematics and algorithms. We then focus on the element method, which is used for proving that one set is a subset of another set. | |||||||
Learning Objectives PF1 |
Prep Direct Proof and the Element Method |
||||||
W Oct. 01 |
Cases, Contradictions, and Counterexamples | ||||||
We introduce several additional proof techniques, as well as the practice of counterexamples for disproving incorrect implications. | |||||||
Learning Objectives PF2 |
Prep Cases, Contradictions, and Counterexamples |
||||||
F Oct. 03 |
Lab 3: Proof Practice | ||||||
We practice proving mathematical statements using a variety of techniques. | |||||||
Learning Objectives PF1, PF2 |
Prep Modular Congruence and Proofs as Writing |
In Class Lab 3: Proof Practice |
Week 5
M Oct. 06 |
Relations | ||||||
We introduce relations, with a special focus on equivalence relations on sets. | |||||||
Learning Objectives FR1 |
Prep Relations and Equivalence Relations |
||||||
W Oct. 08 |
Induction | ||||||
We introduce mathematical induction, a powerful proof technique for demonstrating that a claim is false for infinitely many cases. | |||||||
Learning Objectives PF3, PF4, PF5 |
Prep Introduction to Induction |
||||||
S Oct. 11 |
No Class: Midterm Recess | ||||||
Due Lab 3: Proof Practice |
Week 6
M Oct. 13 |
More Induction | ||||||
We broaden our usage of induction to prove inequalities and write inductive proofs for the correctness of functions. | |||||||
Learning Objectives PF3, PF4, PF5, PF6 |
Prep More Induction |
||||||
W Oct. 15 |
Strong Induction | ||||||
We introduce strong induction as an additional tool for proving mathematical theorems. | |||||||
Learning Objectives PF7 |
Prep Strong Induction |
||||||
F Oct. 17 |
Quiz 2 | ||||||
The second of four quizzes in which students have an opportunity to complete Learning Targets. | |||||||
Due Lab 3: Proof Practice |
Week 7
M Oct. 20 |
Counting | ||||||
We use the principles of addition, multiplication, and inclusion-exclusion to solve counting problems. | |||||||
Learning Objectives C1 |
Prep Counting |
||||||
W Oct. 22 |
Permutations and Combinations | ||||||
We use permutations and combinations to count possibilities in situations involving rearrangement and subset-selection. | |||||||
Learning Objectives C2 |
Prep Permutations and Combinations |
||||||
F Oct. 24 |
Lab 4: Counting Lattice Paths | ||||||
We use binomial coefficients and Python programming to efficiently compute the number of paths through grids. | |||||||
Learning Objectives C1, C2 |
Prep Counting Lattice Paths |
In Class Lab 4: Counting Lattice Paths |
No matching items
Final Exam
Our final exam will be another quiz covering all twenty Learning Targets. So, it’s just like Quiz 4, except you’ll have 3 hours instead of 50 minutes.
© Phil Chodrow, 2025