CS 2022/ MA 2201 Discrete Mathematics
A term 2013
Homework 3, due Monday, September 23
READING: Chapter 1, 2, 3.
1. Exercise 8 on page 216. (15 points)
2. Describe an algorithm for nding the two small
CS 2022/ MA 2201 Discrete Mathematics
A term 2013
Solutions for Homework 5
1. Exercise 28 on page 451.
Solution:
First solution: We need to nd the number of ways for the computer to select its 11 num
CS 2022/ MA 2201 Discrete Mathematics
A term 2013
(Last) Homework 5, due Monday, October 14
READING: Chapters 6, 7, 9 and 10.
1. Exercise 28 on page 451. (15 points)
2. In an experiment you pick at ra
CS 2022/ MA 2201 Discrete Mathematics
A term 2013
Solutions for Homework 4
1. Exercise 14 on page 330.
Solution:
Basis Step: For n = 1 we get 1 21 = (1 1)21+1 + 2, which is true
statement 2 = 2.
Induc
CS 2022/ MA 2201 Discrete Mathematics
A term 2013
Homework 1, due Monday, September 9
Most homeworks will be worth 100 points; consider the point value in
determining how much time you spend on each q
CS 2022/ MA 2201 Discrete Mathematics
A term 2013
Solutions for Homework 1
1. Exercise 14 on page 13.
Solution:
(a) r q
(b) p q r
(c) r p
(d) p q r
(e) (p q ) r
(f) r (q p)
(20 points)
2. Construct tr
CS 2022/ MA 2201 Discrete Mathematics
A term 2013
Solutions for Homework 3
READING: Chapter 1, 2, 3.
1. Exercise 8 on page 216.
Solution: In each case we have to nd the least integer n such that
f (x)
CS 2022/ MA 2201 Discrete Mathematics
A term 2013
Solutions for Homework 2
1. Exercise 24 on page 126.
Solution:
a) The power set of every set includes at least the empty set, so the
power set cannot
Discrete Mathematics
Test Review Click2to edit Master subtitle style 2/15/2010
4/21/10
Set Notation Technicalities
, cfw_ null set cfw_ set that contains the null set as an element cfw_1,2 set that c