COMS BC3213: Discrete Mathematics

Spring 2027
Barnard College

Course Details

Instructor: Prof. Eysa Lee
Email: eylee @ barnard.edu
Office Hours: Monday/Wednesday 4:00pm-5:00pm (Milstein Center 512)

Lectures: Monday/Wednesday 2:40-3:55, Location TBA

Course Links

Syllabus: Link

Lecture Schedule

The schedule below will be updated as the course progresses.

Week Date Topic Homeworks Due Dates
1 1/20 1 - Introduction
2 1/25 2 - Logic: Definitions, propositional logic
1/27 3 - Logical equivalence, tautology, fallacy, contrapositive HW 1
3 2/1 4 - Laws of propositional logic
2/3 5 - Inference: rules and examples HW 2 HW 1 due
4 2/8 6 - First Order Logic (FOL): Quantifiers, predicates
2/10 7 - Negation of FOL propositions, (dis)proving FOL propositions, nested quantifiers HW 3 HW 2 due
5 2/15 8 - Proofs methods: Exhaustive proof (proof by enumeration), direct proof, proof of IFF, proof by contrapositive
2/17 9 - Proof by cases, proof by contradiction, proof by counterexample HW 4 HW 3 due
6 2/22 10 - Set Theory: Sets definition, subsets, universal set, powerset
2/24 11 - Set builders and FOL HW 5 HW 4 due
7 3/1 12 - Operations on sets, cardinality, size of the union, proof on sets
3/3 13 - Relations: representation, properties HW 4 due
8 3/8 14 - Equivalence relations, equivalence classes, partitions
3/10 Exam 1
- 3/15 Academic Holiday
3/17 Academic Holiday
9 3/22 15 - Relation of congruence modulo n
3/24 16 - Partially ordered sets (Posets) HW 6
10 3/29 17 - Functions: Functions, onto, one-to-one, bijections
3/31 18 - Composition, inverse function, pigeon hole principle, countability HW 7 HW 6 due
11 4/5 19 - More Proofs: proof by induction, proof by smallest counter example, strong induction
4/7 20 - Number Theory: Dividing, div and mod operations, GCD, euclid algorithm, prime numbers HW 8 HW 7 due
12 4/12 21 - Fundamental theorem of arithmetic, modular arithmetic
4/14 22 - Introduction to cryptography, RSA. Counting: Lists, factorial, anagrams, permutations HW 9 HW 8 due
13 4/19 23 - Binomial coefficients, principle of inclusion-exclusion (PIE)
4/21 24 - Graph Theory: Fundamentals, terminology, isomorphism, subgraphs, connection, trees, eularian graphs HW 10 HW 9 due
14 4/26 25 - Graph coloring, planar graphs
4/28 26 - Trees, eularian graphs, conclusion HW 10 due
15 4/3 Exam 2