CS 70
Discrete Mathematics and Probability Theory
Spring 2016
Rao and Walrand
Discussion 4A
1. Recursive Calls Calculate the greatest common divisor (gcd) of the following pairs of numbers using the
E
CS 70
Discrete Mathematics and Probability Theory
Fall 2016
Rao and Walrand
Discussion 1A
1. Set Operations
N denotes the set of all natural numbers: cfw_0, 1, 2, 3, ..
Z denotes the set of all inte
CS 70
Discrete Mathematics and Probability Theory
Spring 2016
Rao and Walrand
Discussion 3A
1. Odd Degree Vertices
Claim: Let G = (V, E) be an undirected graph. The number of vertices of G that have o
CS 70
Discrete Mathematics and Probability Theory
Spring 2016
Rao and Walrand
Discussion 2A
1. Power Inequality
Use induction to prove that for all integers n 1, 2n + 3n 5n .
2. Triangle Inequality
Re