Set Theory and Relations 1

S 1
Self Evaluation Test -
Set Theory and Relations ET

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

number of subsets of the first set is 56 more than
(a)
[ f ( x )]2 +[ g ( x )]2=0 (b)
g ( x)
the total number of subsets of the second set. The
values of m and n are g( x)
[MNR 1998, 91; UPSEAT 1999, (c)
f ( x) (d) None of these
2000; Kerala (Engg.) 2003, 05]
(a) 7, 6 (b) 6, 3 7. If
n( A )=3 and n( B )=6 and A ⊆ B . Then the
(c) 5, 1 (d) 8, 7 number of elements in A∩B is equal to

2. If
aN ={ax : x ∈ N } and bN ∩cN =dN , where b, (a) 3 (b) 9
c ∈ N are relatively prime, then (c) 6 (d) None of these
[DCE 1999] 8. In a certain town 25% families own a phone and
15% own a car, 65% families own neither a phone
(a) d=bc (b) c=bd nor a car. 2000 families own both a car and a
phone. Consider the following statements in this
(c) b=cd (d) None of these regard:
A1 , A 2 , A 3 , .. ...... , A 30 1. 10% families own both a car and a phone
3. Suppose are thirty sets each
B1 , B 2 2. 35% families own either a car or a phone
having 5 elements and , ......., Bn are n sets 3. 40,000 families live in the town
30 n
¿ Ai = ¿ B j Which of the above statements are correct
each with 3 elements. Let i=1 = S and j=1 (a) 1 and 2 (b) 1 and 3
each elements of S belongs to exactly 10 of the (c) 2 and 3 (d) 1, 2 and 3
A'i s B'j s 9. Given the relation R = {(1, 2), (2, 3)} on the set A =
and exactly 9 of the . Then n is equal to
{1, 2, 3}, the minimum number of ordered pairs
[IIT 1981; MNR 1987]
which when added to R make it an equivalence
(a) 15 (b) 3 relation is
(c) 45 (d) None of these (a) 5 (b) 6
(c) 7 (d) 8
4. If
A={1, 2, 3, 4, 5}, then the number of proper
10. Let
A={2, 4 , 6, 8}. A relation R on A is defined by
subsets of A is
[Pb. CET 2001; Karnataka CET 1997] R={(2, 4), (4 , 2), (4 , 6), (6 , 4)}. Then R is
(a) 120 (b) 30 [Karnataka CET 1995]

(c) 31 (d) 32 (a) Anti-symmetric (b) Reflexive

(c) Symmetric (d) Transitive
5. Let A and B be two non-empty subsets of a set X
such that A is not a subset of B, then 11. Let N denote the set of all natural numbers and R
[UPSEAT 1995, 99] be the relation on N×N defined by (a, b) R (c, 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
8 x≡6(mod 14 ), x ∈ Z , are
6. If
A=[ x : f ( x )=0 ] and B=[ x :g ( x )=0 ] , then A  B
(a) [8]  [6] (b) [8]  [14]
will be (c) [6]  [13] (d) [8]  [6]  [13]
 2 Set Theory and Relations
13. If A = {1, 2, 3} , B = {1, 4, 6, 9} and R is a R
relation from A to B defined by ‘x is greater than (c) 3 = {(p, p), (q, q), (r, r), (p, q)}
y’. The range of R is (d) None of these
(a) {1, 4, 6, 9} (b) {4, 6, 9} 15. Let L be the set of all straight lines in the
(c) {1} (d) None of these l1 l2
Euclidean plane. Two lines and are said to be
14. Let A = {p, q, r}. Which of the following is an l1 l2
equivalence relation on A related by the relation R iff is parallel to .
Then the relation R is
R1
(a) = {(p, q), (q, r), (p, r), (p, p)} (a) Reflexive (b) Symmetric
R2 (c) Transitive (d) Equivalence
(b) = {(r, q), (r, p), (r, r), (q, q)}

A Answers and Solutions

S

(SET - 1)

1. (b) Since 2m−2 n=56=8×7=23 ×7 n (P∪C )c =65 % and n( P∪C )=35 %

n m−n 3
 2 (2 −1)=2 ×7 , ∴ n=3 and Now, n( P∪C )=n (P )+n(C )−n( P∩C )
m−n 3
2 =8=2 35=25+15−n( P∩C )
 m−n=3  m−3=3  m=6 ; ∴ m=6 , n=3 . n( P∩C )=40−35=5 . Thus n (P∩C )=5 %
2. (a) bN = the set of positive integral multiples of b, But n (P∩C )=2000
cN = the set of positive integral multiplies of c.  Total number of families
∴ bN ∩cN = the set of positive integral 2000×100
= =40 , 000
multiples of bc 5
= b ⊂ N , [∵ b, c are prime] Since, n( P∪C )=35 %
∴ d=bc . and total number of families = 40,000
and n( P∩C )=5 % .  (2) and (3) are correct.
( )
1 30
O ¿ A i = (5×30)=15 9. (c) R is reflexive if it contains (1, 1), (2, 2), (3, 3)
3. (c) O(S) = i=1 10
∵ (1, 2) ∈ R, (2, 3)∈R
Since, element in the union S belongs to 10 of
' ∴ R is symmetric if (2, 1), (3, 2)  R.
Ai s

( ) Now, R={(1 , 1), (2 , 2), (3 , 3 ), (2, 1), (3, 2), (2 , 3), (1 , 2)}
n 3n n
O ¿ Bj = = R will be transitive if (3, 1); (1, 3)  R. Thus, R
Also, O(S) = j =1 9 3,  becomes an equivalence relation by adding (1,
n 1) (2, 2) (3, 3) (2, 1) (3,2) (1, 3) (3, 1). Hence,
=15 ⇒n=45
3 . the total number of ordered pairs is 7.
10. (c) Given A = {2, 4, 6, 8}; R = {(2, 4)(4, 2) (4, 6)
4.
n
(c) The number of proper subset =2 −1 (6, 4)} ***
5
=2 −1 =32−1=31 . −1
=R .
(a, b)  R  (b, a)  R and also R
5. (d) ∵ A is not a subset of B Hence, R is symmetric.
∴ Some point of A will not be a point of B, So 11. (d) For (a, b), (c, d)  N × N
c
that point will being to B . Hence A and (a, b)R (c , d)⇒ ad (b+c)=bc(a+d)
complement of B are always non-disjoint.
Reflexive : Since ab (b+a ) = ba( a+b )∀ ab ∈ N ,
6. (a) A ∩B =¿ ¿and x∈ B ¿¿
∴ (a, b)R(a, b) , ∴ R is reflexive.
=[ x :f (x )=0 and g( x )=0 ] =[ f ( x )]2 +[ g ( x )]2=0 .
Symmetric : For (a, b), (c , d)∈N×N , let
7. (a) Since A ⊆ B ,  A∩B= A
(a, b)R(c , d)
 n ( A∩B )=n( A )=3 . ∴ ad (b +c )=bc( a+d )  bc (a+d )=ad (b+c )
8. (c) n( P )=25 %, n(C )=15 %
 cb (d +a )=da (c+b )  (c , d) R(a, b)
n (P c∩C c )=65 %, n( P∩C )=2000 ∴ R is symmetric
c c
Since, n (P ∩C )=65 % Transitive : For (a, b),(c , d), (e , f )∈N×N ,
 Set Theory and Relations 3

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) 8 x−6=14 P , ( x ∈ Z )

1
x= [ 14 P+6]
 8 , ( x ∈Z )
1
(7 P+3 )
 x = 4  x = 6, 13, 20, 27, 34, 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 ( p , q )∈ R1 but
is not symmetric because
(q , p )∉ R1
R2 (r , q ) ∈ R2 but
is not symmetric because
(q , r ) ∉ R2
R3 ( p , q )∈ R3 but
is not symmetric because
(q , p )∉ R3 .
R1 , R2 , R 3
Hence, are not equivalence relation.
l 1 Rl 2
15. (a,b,c,d) Here
l1 l l l
is parallel 2 and also 2 is parallel to 1 , so
it is symmetric.
Clearly, it is also reflexive and transitive.
Hence it is equivalence relation.