# Assignments

Solutions to the following Problem Sets are not available to the general public, as the assignments took substantial effort to compose—often 4-6 hours per problem—so it is essential that the course staff be able to re-use problems in later terms. Instructors or their students at recognized institutions may contact Prof. Meyer to request solutions on a case-by-case basis.

SES # COURSEWARE ASSIGNMENTS
Unit 1: Proofs
1 1.1 Intro to Proofs Problem Set 1 (PDF)
2 1.2 Proof Methods
3 1.3 Well Ordering Principle
4 1.4 Logic & Propositions
5 1.5 Quantifiers & Predicate Logic Problem Set 2 (PDF)
6 1.6 Sets
7 1.7 Binary Relations Problem Set 3 (PDF)
8 1.8 Induction
9 1.9 State Machines - Invariants Problem Set 4 (PDF)
10 1.10 Recursive Definition
11 1.11 Infinite Sets
Unit 2: Structures
12 2.1 GCDs Problem Set 5 (PDF)
13 2.2 Congruences
14 2.3 Euler's Theorem
15 2.4 RSA Encryption Problem Set 6 (PDF)
16 2.5 Digraphs: Walks & Paths
17 2.6 Directed Acyclic Graphs (DAGs) & Scheduling Problem Set 7 (PDF)
18 2.7 Partial Orders and Equivalence
19 2.8 Degrees & Isomorphism
20 2.9 Coloring & Connectivity Problem Set 8 (PDF)
21 2.10 Trees
22 2.11 Stable Matching
Unit 3: Counting
23 3.1 Sums & Products Problem Set 9 (PDF)
24 3.2 Asymptotics
25 3.3 Counting with Bijections Problem Set 10 (PDF)
26 3.4 Repetitions & Binomial Theorem
27 3.5 Pigeonhole Principle, Inclusion-Exclusion
Unit 4: Probability
28 4.1 Intro to Discrete Probability Problem Set 11 (PDF)
29 4.2 Conditional Probability
30 4.3 Independence & Causality Problem Set 12 (PDF)
31 4.4 Random Variables, Density Functions
32 4.5 Expectation
33 4.6 Deviation: Markov & Chebyshev Bounds No Assignment
34 4.7 Sampling & Confidence
35 4.8 Random Walks & Pagerank