Assignment IIIrd - B.E.

III Semester
Discrete Mathematics
last date for submission - 28
th
August 2011
Answer all questions
1. f:X Y.
(a) How many dierent functions are possible.
(b) How many dierent one to one functions are possible.
(c) How many dierent one-one and onto functions are possible.
2. Find the number of onto functions from n element set to 2 element set.
3. For each of the following check whether R is Relexive, Symmetric, Anti-symmetric,
Transitive, An equivalence, A partial order.
a. R = {(a, b)|a b is an odd positive integers}.
b. R = {(a, b)|a = b
2
where a, b I
+
}.
c. Let P be the set of all people. Let R be a binary relation on P such that (a,b) is in R
if a is a brother of b.
d. Let R be a binary relation on the set of all strings of 0s and 1s, such that R = (a,b)
a and b are strings that have same number of 0s.
4. Let R be a symmetric and transitive relation on set A. Show that if for every a in A
there exists b in A, such that (a,b) is in R, then R is an equivalence relation.
5. Let R be a transitive and reexive relation on A.Let T be a relation on A, such that
(a,b) is in T if and only if both (a,b) and (b,a) are in R. Show that T is an equivalence
relation.
6. Using adjacency matrix,
(a) nd the number of dierent reexive relation on set A with n-elements.
(b) nd the number of dierent symmetric relation on set A with n-elements.
(c) How many of them are relexive and symmetric?
7. Let R be a binary relation. Let S = {(a, b)|(a, c) R and (c, b) R for some C}.Show
that if R is an equivalence relation, then S is also an equivalence relation.
8. Let R be a relexive relation on a set A. Show that R is an equivalence relation if (a,b)
and (a,c) are in R implies that (b,c) is in R.
9. Let A be a set with n elements.Prove that there are 2
n
2
binary rlations on A.
10. Consider the set of integers(I). For each of the following relations verify Reexive,Symmetric,Antisymmetric
and Transitive.
(a) R1 = Divides with an integer quotient.
(b) R2 = Empty relation.
11. Which of these relations on 0, 1, 2, 3 are equivalence relations? Determine the properties
of an equivalence relation that others lack.
(a) {(0, 0), (1, 1), (2, 2), (3, 3)}
(b) {(0, 0), (0, 2), (2, 0), (2, 2), (2, 3), (3, 2), (3, 3)}
(c) {(0, 0), (1, 1), (1, 2), (2, 1), (2, 2), (3, 3)}
(d) {(0, 0), (1, 1), (1, 3), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)}
(b) {(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0), (2, 2), (3, 3)}
12. Draw the hasse diagram for the poset (A,(superset)),where A denotes the power set of
set(a,b,c).
13. Dene equivalence class.Find all equivalence classes of the congruence relation mod 5 on
the sets of integer.
14. Find the equivalence relation on A = {a, b, c} corresponding to the partition of set A as
{{a}, {b}, {c}}.
15. Let R be an equivalence relation on a set A, with a and b any two elements in A.Then
prove that [a] = [b] if and only if aRb.
16. Solve following recurrence problem:
(i) T(n) = T(n-1) + n; (ii) T(n) = T(n/2) + n;
(iii) T(n) = 2T(n/2) + n (iv) T(n) = T(n/2) + 1;
17. Explain Tower of Hanoi problem. Find the recurrence relation for it and solve it.
18. Solve f(n) 3f(n 1) 4f(n 2) = 4
n
19. Solve f(n) 2f(n 1) + f(n 2) = 7
20. Solve f(n + 2) 2f(n + 1) + f(n) = 0; f(0) = 2, f(1) = 30
21. Solve f(n + 2) 3f(n + 1) + 2f(n) = 2
n
;
22. Solve f(n) 5f(n 1) 6f(n 2) = 2
n
+ n
23. Using generating function,Solve f(n) = f(n 1) + f(n 2); f(0) = 1, f(1) = 1
end
2