CSCI 0220
Discrete Structures and Probability
C. Klivans
Homework 2
Due: Tuesday, 11 Feb 2014
All homeworks are due at 11:00PM in the CS22 bin on the CIT second oor,
next to the Fishbowl.
Write your f
CSCI 0220
Discrete Structures and Probability
C. Klivans
Homework 3
Due: Wednesday, 20 Feb 2013
All homeworks are due at 11:00PM in the CS22 bin on the CIT second oor,
next to the Fishbowl.
Write your
CSCI 0220
Discrete Structures and Probability
C. Klivans
Homework 1
Due: Tuesday, 4 Feb 2013
All homeworks are due at 11:00PM in the CS22 bin on the CIT second oor,
next to the Fishbowl.
Write your fu
CSCI 0220
Discrete Structures and Probability
C. Klivans
Homework 5
Due: Tuesday, 11 Mar 2014
All homeworks are due at 11:00PM in the CS22 bin on the CIT second oor,
next to the Fishbowl.
Write your f
CSCI 0220
Discrete Structures and Probability
C. Klivans
Homework 4
Due: Tuesday, 4 Mar 2014
All homeworks are due at 11:00PM in the CS22 bin on the CIT second oor,
next to the Fishbowl.
Write your fu
Induction
Requirements
1. Formally state the property that will be proved inductively.
2. Prove the property holds in the base case.
3. Formally state the inductive hypothesis.
4. Assume the inductive
CSCI 0220
Discrete Structures and Probability
C. Klivans
Homework 6
Due: Tuesday, 18 Mar 2014
All homeworks are due at 11:00PM in the CS22 bin on the CIT second oor,
next to the Fishbowl.
Write your f
CSCI 0220
Discrete Structures and Probability
C. Klivans
Homework 7
Due: Wednesday, 2 Apr 2014
All homeworks are due at 11:00PM in the CS22 bin on the CIT second oor,
next to the Fishbowl.
Write your
Set Identities
Let all sets referred to below be subsets of a universal set U .
1. Commutative Laws: For all sets A and B,
(a) A B = B A and (b) A B = B A
2. Associative Laws: For all sets A, B, and C
Division into Cases
Requirements
1. Show that the proposition always falls into one of a few cases.
2. List the cases.
3. Under each case, give a proof that the proposition holds for that case.
4. Con
Memory Circuits
CS22
March 16, 2013
Combinatorial circuits consisting of AND, OR, and NOT gates are very useful
in modeling conditions or boolean expressions. For example, the above circuits
output is
Bijection
Requirements
1. Formally dene the two sets claimed to have equal cardinality.
2. Formally dene a function from one set to the other.
3. Prove that the function is bijective by proving that i
Logical Equivalences
Given any statement variables p, q, and r, a tautology t and a contradiction c, the
following logical equivalences hold.
1. Commutative Laws:
p q q p and p q q p
2. Associative La
CSCI 0220
Discrete Structures and Probability
C. Klivans
Homework 10
Due: Tuesday, 29 April 2014
All homeworks are due at 11:00PM in the CS22 bin on the CIT second oor,
next to the Fishbowl.
Write you
CSCI 0220
Discrete Structures and Probability
C. Klivans
Homework 9
Due: Tuesday, 22 Apr 2013
All homeworks are due at 11:00PM in the CS22 bin on the CIT second oor,
next to the Fishbowl.
Write your f
CSCI 0220
Discrete Structures and Probability
C. Klivans
Homework 8
Due: Tuesday, 15 Apr 2014
All homeworks are due at 11:00PM in the CS22 bin on the CIT second oor,
next to the Fishbowl.
Write your f
Set Equivalence
The following are two sample proofs of the equivalence
(A B) (A B) = A (B (A B).
One uses the element method. The other uses set algebra.
NOTE: Drawing a Venn diagram of each does not
More Induction Proofs
Example 1
Prove that f (n) = 6n2 + 2n + 15 is odd for all n Z+ .
Proof by induction:
Dene P (n) as the property that f (n) is odd.
Base case: We prove P (1).
2(1) + 15 + 6(1)2 =