Scribd
Upload
179 views

DM PDF

This document outlines the homework assignment for CS 310 due on April 13, 2005. It contains 6 problems covering topics such as set operations, functions, relations, and Hasse diagrams. Students are asked to determine the number of students taking certain subjects, analyze properties of functions, compute function compositions, identify properties of relations, prove an equivalence relation, and draw Hasse diagrams for relations of inclusion and divisibility.

Uploaded by

Purushothama Reddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
179 views

DM PDF

This document outlines the homework assignment for CS 310 due on April 13, 2005. It contains 6 problems covering topics such as set operations, functions, relations, and Hasse diagrams. Students are asked to determine the number of students taking certain subjects, analyze properties of functions, compute function compositions, identify properties of relations, prove an equivalence relation, and draw Hasse diagrams for relations of inclusion and divisibility.

Uploaded by

Purushothama Reddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CS 310

Homework Assignment No. 2


Due on Tue 4/13/2005

1. In a university with 300 students enrolled 140 students are taking French, 120 are
taking business, 130 are taking music, 30 are taking French and business, 40 are
taking business and music, 50 are taking French and music, and 10 are taking French,
business and music. How many students:
(a) are taking exactly two of those subjects?
(b) are taking exactly one of those subjects?
(c) are not taking any of the three subjects?

2. For each of the following functions determine whether it is one-to-one, or onto, or


both. If the function is bijective find its inverse.
(a) f : Z Z, f (n) = 2n + 1.
(b) f : Z Z, f (n) = 7 n.
(c) f : Z Z, f (n) = b n+1
2
c.
(d) f : Z Z Z, f (m, n) = m + n.
(e) f : Z Z Z, f (m, n) = m2 + n2 .
(f) f : Z Z Z, f (n) = (n2 , n2 ).
(g) f : Z Z Z, f (n) = (n2 , n3 ).
1
(h) f : (0, 1) R+ , f (x) = 1.
1x
3. Let f and g be the functions from Z+ to Z+ (Z+ = positive integers) defined by
f (n) = n2 , g(n) = 2n . Find the compositions f f , g g, f g, and g f .

4. Find the properties (reflexive, transitive, symmetric, antisymmetric) verified by the


following relations:
(a) Strict inequality of integers: x R y x < y.
(b) Set disjointness: A R B A B = .
(c) The following relation on Q: x R y x y Z.
(d) The following relation on Q: x R y x y N.

5. Prove that the following is an equivalence relation on Z Z :


(a, b) R (c, d) a d = b c .
Is it an equivalence relation on Z Z?

6. Draw the Hasse diagrams for the following relations:


(a) Inclusion on the set P(S), where S = {a, b, c}.
(b) Divisibility on the set of all positive divisors of 30.
(c) Divisibility on the set of all positive divisors of 24.

You might also like