CS 70 at UC Berkeley

# Discrete Mathematics and Probability Theory

Lecture: Tu/Th 12:30-2 pm, Wheeler 150

### Week 0 Overview

## Propositional Logic, Proofs

### Week 1 Overview

## Induction, Stable Marriage

### Week 2 Overview

## Graphs

### Week 3 Overview

## Modular Arithmetic

### Week 4 Overview

## RSA, Midterm

### Week 5 Overview

## Polynomials

### Week 6 Overview

## Countability, Computability, Counting

### Week 7 Overview

## Counting, Introduction to Probability

### Week 8 Overview

## Conditional Probability, Inclusion/Exclusion

## Notes

There is no textbook for this class. Instead, there is a set of comprehensive lecture notes. Make sure you revisit the notes after every lecture, and multiple times thereafter: you should be aware that it will likely take several readings before you fully understand the material. Each note may be covered in one or more lectures. See Policies for more information.

- Note 0: Review of Sets, Notation
- Note 1: Propositional Logic
- Note 2: Proofs
- Note 3: Induction
- Note 4: Stable Marriage
- Note 5: Graph Theory
- Note 6: Modular Arithmetic
- Note 6a: Chinese Remainder Theorem
- Note 7: Public Key Cryptography
- Note 8: Polynomials
- Note 9: Error Correcting Codes
- Note 10: Infinity and Uncountability
- Note 11: Self-Reference and Uncomputability
- Note 12: Counting
- Note 13: Introduction to Discrete Probability
- Note 14: Conditional Probability
- Note 15: Random Variables: Distribution & Expectation
- Note 16: Random Variables: Variance & Covariance
- Note 17: Applications
- Note 18: Concentration Inequalities and LLN
- Note 19: Geometric and Poisson Distributions
- Note 20: Continuous Probability Distributions
- Note 21: Finite Markov Chains

## Discussions

The discussion sections will not cover new material, but rather will give you additional practice solving problems. You can attend any discussion section you like. However, if there are fewer desks than students, then students will be admitted to the section on a first-come first-served basis and others will have to attend an alternative section. See Policies for more information.

- Discussion 00a: Propositional Logic (solution)
- Discussion 00b: Proofs (solution)
- Discussion 01a: Induction (solution)
- Discussion 01b: Stable Marriage (solution)
- Discussion 02a: Graphs I (solution)
- Discussion 02b: Graphs II (solution)
- Discussion 03a: Modular Arithmetic I (solution)
- Discussion 03b: Modular Arithmetic II (solution)
- Discussion 04a: RSA (solution)
- Discussion 05a: Polynomials, Secret Sharing (solution)
- Discussion 05b: Error-Correcting Codes (solution)
- Discussion 06a: Countability, Computability (solution)
- Discussion 06b: Counting I (solution)
- Discussion 07a: Counting II (solution)
- Discussion 07b: Introduction to Probability (solution)

## Homeworks

Homeworks are graded for accuracy and it is highly recommended that you do them. Your lowest **two** homework scores will be dropped, but these drops should be reserved for emergencies. No additional allowances will be made for late or missed homeworks: please do not contact us about missed homeworks or late submissions. See Policies for more information.

- HW 00: Course Logistics (TeX) (Sol)
- HW 01: Propositional Logic, Proofs (TeX) (Sol)
- HW 02: Induction, Stable Marriage (TeX) (Sol)
- HW 03: Graphs, Modular Arithmetic (TeX) (Sol)
- HW 04: Modular Arithmetic (TeX) (Sol)
- HW 05: RSA, Secret Sharing (TeX) (Sol)
- HW 06: Error Correcting, Countability, Computability (TeX) (Sol)
- HW 07: Counting (TeX) (Sol)
- HW 08: Probability, Conditional Probability (TeX)
- Homework 09: Independence, Random Variables
- Homework 10: Variance, Joint Distributions
- Homework 11: Applications, Inequalities
- Homework 12: Geometric and Poisson Distributions, Continuous Random Variables
- Homework 13: Continuous Random Variables, Markov Chains

## Lecture Schedule

- Lecture 1 (1/22): Introduction, Propositional Logic, First-Order Logic (full) (6up) (Note 1)
- Lecture 2 (1/24): Proof: The Basics and a bit of Induction (full) (6up) (Note 2)
- Lecture 3 (1/29): More Induction (full) (6up) (Note 3)
- Lecture 4 (1/31): Stable Marriage (full) (6up) (Note 4)
- Lecture 5 (2/5): Graphs (full) (6up) (Note 5)
- Lecture 6 (2/7): More Graphs (full) (6up) (Note 5)
- Lecture 7 (2/12): Modular Arithmetic (full) (6up) (Note 6)
- Lecture 8 (2/14): Fermat/CRT/ Begin RSA (full) (6up) (Note 7)
- Lecture 9 (2/19): RSA/ Midterm Review (full) (6up) (Note 7)
- Lecture 10 (2/26): Polynomials (full) (6up) (Note 8)
- Lecture 11 (2/28): Polynomials:Error Correction (full) (6up) (Note 9)
- Lecture 12 (3/5): Countability/Undecidability (full) (6up) (Note 10Note 11)
- Lecture 13 (3/7): Undecidability/Counting (full) (6up) (Note 11)
- Lecture 14 (3/12): Counting (full) (6up) (Note 11) (Draft)