EECS 70 Discrete Mathematics and Probability Theory Fall 2021 To Infinity And Beyond: Countability and Computability This note ties together two topics that might seem…
EECS 70 Discrete Mathematics and Probability Theory Spring 2021 and Note 12 Self-Reference and Computability In this lecture we will explore the deep connection between…
CS 70 Discrete Mathematics and Probability Theory Fall 2021 What is the number of strings you can construct given: (a) n ones, and m zeroes?…
CS 70 Discrete Mathematics and Probability Theory Fall 2021 1 True or False (a) Any pair of vertices in a tree are connected by exactly…
EECS 70 Discrete Mathematics and Probability Theory Fall 2021 1 Graph Theory: An Introduction One of the fundamental ideas in computer science is the notion…
CS 70 Discrete Mathematics and Probability Theory Fall 2021 1 Extended Euclid In this problem we will consider the extended Euclid’s algorithm. The bolded numbers…
CS 70 Discrete Mathematics and Probability Theory Fall 2021 1 Party Tricks You are at a party celebrating your completion of the CS 70 midterm.…
EECS 70 Discrete Mathematics and Probability Theory Fall 2021 Review of Sets and Mathematical Notation A set is a well defined collection of objects. These…
CS 70 Discrete Mathematics and Probability Theory Fall 2021 1 Counting Strings (a) How many bit strings of length 10 contain at least five consecutive…
EECS 70 Discrete Mathematics and Probability Theory Fall 2021 1 Mathematical Induction Introduction. In this note, we introduce the proof technique of mathematical induction. Induction…