18 Set Theory and Relations

1. Two finite sets have m and n elements. The total g(x)

number of subsets of the first set is 56 more than (c) (d) None of these
f(x)
the total number of subsets of the second set. The
values of m and n are 7. If n(A) 3 and n(B) 6 and A B . Then
[MNR 1998, 91; UPSEAT 1999, the number of elements in A B is equal to
2000; Kerala (Engg.) 2003, 05]
(a) 3 (b) 9
(a) 7, 6 (b) 6, 3
(c) 6 (d) None of these
(c) 5, 1 (d) 8, 7
8. In a certain town 25% families own a phone and
2. If aN {ax : x N} and bN cN dN , where 15% own a car, 65% families own neither a phone
b, c N are relatively prime, then nor a car. 2000 families own both a car and a
[DCE 1999] phone. Consider the following statements in this
regard:
(a) d bc (b) c bd
1. 10% families own both a car and a phone
(c) b cd (d) None of these 2. 35% families own either a car or a phone
3. Suppose A1, A2, A3,........,A30 are thirty sets 3. 40,000 families live in the town

each having 5 elements and B1, B2 , ......., Bn are Which of the above statements are correct
(a) 1 and 2 (b) 1 and 3
30 n
n sets each with 3 elements. Let Ai Bj = (c) 2 and 3 (d) 1, 2 and 3
i 1 j 1
9. Given the relation R = {(1, 2), (2, 3)} on the set A =
S and each elements of S belongs to exactly 10 of
{1, 2, 3}, the minimum number of ordered pairs
'
the Ai's and exactly 9 of the B j s . Then n is which when added to R make it an equivalence
relation is
equal to [IIT 1981; MNR 1987]
(a) 5 (b) 6
(a) 15 (b) 3
(c) 7 (d) 8
(c) 45 (d) None of these
10. Let A {2, 4, 6, 8} . A relation R on A is defined
4. If A {1, 2, 3, 4, 5}, then the number of proper by R {(2, 4),(4, 2),(4, 6),(6, 4)}. Then R
subsets of A is is
[Pb. CET 2001; Karnataka CET 1997]
[Karnataka CET 1995]
(a) 120 (b) 30 (a) Anti-symmetric (b) Reflexive
(c) 31 (d) 32 (c) Symmetric (d) Transitive
5. Let A and B be two non-empty subsets of a set X 11. Let N denote the set of all natural numbers and R
such that A is not a subset of B, then be the relation on N N defined by (a, b) R (c,
[UPSEAT 1995, 99] d) if
(a) A is always a subset of the complement of B ad(b c) bc(a d), then R is
[Roorkee 1995]
(b) B is always a subset of A
(a) Symmetric only (b) Reflexive only
(c) A and B are always disjoint (c) Transitive only (d) An equivalence
(d) A and the complement of B are always non- relation
disjoint 12. The solution set of 8x 6(mod14), x Z , are
6. If A [x : f(x) 0] and B [x : g(x) 0] , (a) [8] [6] (b) [8] [14]
then A B will be (c) [6] [13] (d) [8] [6] [13]
13. If A = {1, 2, 3} , B = {1, 4, 6, 9} and R is a
f(x) relation from A to B defined by x is greater than
(a) [ f(x)]2 [g(x)]2 0 (b)
g(x) y. The range of R is
(a) {1, 4, 6, 9} (b) {4, 6, 9}
 19 Set Theory and Relations
(c) {1} (d) None of these (d) None of these
14. Let A = {p, q, r}. Which of the following is an 15. Let L be the set of all straight lines in the
equivalence relation on A Euclidean plane. Two lines l1 and l2 are said to
(a) R1 = {(p, q), (q, r), (p, r), (p, p)} be related by the relation R iff l1 is parallel to l2
(b) R2 = {(r, q), (r, p), (r, r), (q, q)} . Then the relation R is
(a) Reflexive (b) Symmetric
(c) R3 = {(p, p), (q, q), (r, r), (p, q)}
(c) Transitive (d) Equivalence

(SET - 1)

1. (b) Since 2m 2n 56 8 7 23 7 Since, n(P c C c ) 65%

2n (2mn 1) 23 7 , n 3 and n(P C)c 65% and n(P C) 35%
2mn 8 23 Now, n(P C) n(P ) n(C) n(P C)
m n 3 m 3 3 m 6 ; 35 25 15 n(P C)
m 6, n 3 .
n(P C) 40 35 5 . Thus
2. (a) bN the set of positive integral multiples of n(P C) 5%
b, cN = the set of positive integral multiplies
But n(P C) 2000
of c.
Total number of families
bN cN = the set of positive integral
multiples of bc 2000 100
40,000
= b N , [ b, c are prime] 5
d bc . Since, n(P C) 35%
30 1 and total number of families = 40,000
3. (c) O(S) = O Ai (5 30) 15 and n(P C) 5% . (2) and (3) are correct.
i 1 10
9. (c) R is reflexive if it contains (1, 1), (2, 2), (3, 3)
Since, element in the union S belongs to 10 of
'
A s
i
(1, 2) R, (2, 3) R
n 3n n R is symmetric if (2, 1), (3, 2) R.
Also, O(S) = O
j Bj
9 3, Now,
1
R {(1, 1),(2, 2),(3, 3),(2, 1),(3, 2),(2, 3),(1, 2)}
n
15 n 45 . R will be transitive if (3, 1); (1, 3) R. Thus, R
3 becomes an equivalence relation by adding (1,
4. (c) The number of proper subset 2n 1 1) (2, 2) (3, 3) (2, 1) (3,2) (1, 3) (3, 1). Hence,
the total number of ordered pairs is 7.
25 1 32 1 31. 10. (c) Given A = {2, 4, 6, 8}; R = {(2, 4)(4, 2) (4, 6) ***
5. (d) A is not a subset of B (6, 4)}
Some point of A will not be a point of B, (a, b) R (b, a) R and also R1 R .
So that point will being to B c . Hence A and Hence, R is symmetric.
complement of B are always non-disjoint. 11. (d) For (a, b), (c, d) N N

A B {x : x A
(a, b)R(c, d) ad(b c) bc(a d)
6. (a) and x B} Reflexive : Since ab(b a) =
ba(a b)ab N ,
[x : f(x) 0 and g(x) 0] (a, b)R(a, b) , R is reflexive.

[ f(x)]2 [g(x)]2 0 . Symmetric : For (a, b),(c, d) N N , let

(a) Since A B, (a, b)R(c, d)
7. A B A
n(A B) n(A) 3 . ad(b c) bc(a d)

8. (c) n(P ) 25%, n(C) 15% bc(a d) ad(b c)

n(P c C c ) 65%, n(P C) 2000 cb(d a) da(c b) (c, d)R(a, b)

R is symmetric
 Set Theory and Relations 20
Transitive : For
(a, b),(c, d),(e, f) N N,
Let (a, b)R(c, d),(c, d)R(e, f)
ad(b c) bc(a d) ,
cf(d e) de(c f)
adb adc bca bcd ..(i)
and cfd cfe dec def ..(ii)
(i) ef (ii) ab gives,
adbef adcef cfdab cfeab
= bcaef bcdef decab defab
adcf(b e) bcde
(a f)
af(b e) be(a f)
(a, b)R (e, f) .
R is transitive. Hence R is an equivalence
relation.
12. (c) 8x 6 14P, (x Z)
1
x [14P 6] , (x Z)
8
1
x = (7P 3) x = 6, 13, 20, 27, 34,
4
41, 48,..
Solution set = {6, 20, 34, 48,...} {13,
27, 41, ....}
= [6] [13],
where [6], [13] are equivalence classes of 6
and 13 respectively.
13. (c) Here R is a relation A to B defined by ' x is
greater than y'
R {(2,1);(3,1)}
Hence, range of R {1} .
14. (d) Here A {p, q, r}
R1 is not symmetric because (p, q) R1
but (q, p) R1
R2 is not symmetric because (r, q) R2
but (q, r) R2
R3 is not symmetric because (p, q) R3
but (q, p) R3 .
Hence, R1, R2, R3 are not equivalence
relation.
15. (a,b,c,d) Here l1Rl2
l1 is parallel l2 and also l2 is parallel to l1
, so it is symmetric.
Clearly, it is also reflexive and transitive.
Hence it is equivalence relation.