Discrete Structures
CS2800
Homework 2 Solutions
Functions, Cardinality, and Induction
1. (a) Prove that |X| = |X|.
Solution
Let f : X X be given by f (x) := x. Then f is trivially bijective. Thus |X| = |X|.
(b) MCS 8.1
Solution Let A and B be countable. T
Discrete Structures
CS2800
Homework 3 Solutions
Induction
1. MCS 5.6(a)
Solution Let P (n) be the statement that in 2n 2n grid with a 1 1 statue in a corner can be covered
with L-shaped tiles. We prove P (n) for n 1 by induction.
Base case: Its clear that
Antara Palit
ap843
INFO 2040: Networks
Problem Set 2
Defender
1. Blank
a. Nash equilibrium is the upper right quadrant.
b. Nash equilibrium is the upper left quadrant.
c. The two pure strategy equilibria are (U, L) and (D, R). The mixed strategy equilibri
Last Name:
First:
Netid:
Section
CS 1110 Prelim 2 November 12th, 2015
This 90-minute exam has 6 questions worth a total of 100 points. Scan the whole test before starting.
Budget your time wisely. Use the back of the pages if you need more space. You may