Chapter

1
Set Theory and Relations

Set Theory Types of sets

(1) Null set or Empty set : The set which contains no element
Introduction at all is called the null set. This set is sometimes also called the ‘empty
A set is well defined class or collection of objects. set’ or the ‘void set’. It is denoted by the symbol  or {}.
A set is often described in the following two ways. (2) Singleton set : A set consisting of a single element is
(1) Roster method or Listing method : In this method a called a singleton set. The set {5} is a singleton set.
set is described by listing elements, separated by commas, within (3) Finite set : A set is called a finite set if it is either void set
braces {}. The set of vowels of English alphabet may be described or its elements can be listed (counted, labelled) by natural number
as {a, e, i, o, u}. 1, 2, 3, … and the process of listing terminates at a certain natural
(2) Set-builder method or Rule method : In this method, number n (say).
a set is described by a characterizing property P(x) of its elements Cardinal number of a finite set : The number n in the
x. In such a case the set is described by {x : P(x) holds} or {x | above definition is called the cardinal number or order of a finite
P(x) holds}, which is read as ‘the set of all x such that P(x) holds’. set A and is denoted by n(A) or O(A).
The symbol ‘|’ or ‘:’ is read as ‘such that’. (4) Infinite set : A set whose elements cannot be listed by
The set A  {0, 1, 4, 9, 16,....} can be written as the natural numbers 1, 2, 3, …., n, for any natural number n is
called an infinite set.
A  {x 2 | x  Z } . (5) Equivalent set : Two finite sets A and B are equivalent if
 Symbols their cardinal numbers are same i.e. n(A) = n(B).
Example : A  {1, 3, 5, 7} ; B  {10, 12, 14, 16} are
Symbol Meaning
equivalent sets, [ O( A)  O(B)  4] .
 Implies
(6) Equal set : Two sets A and B are said to be equal iff
 Belongs to
every element of A is an element of B and also every element of B
AB A is a subset of B
is an element of A. Symbolically, A = B if x  A  x  B.
 Implies and is implied by
Example : If A  {2, 3, 5, 6} and B  {6, 5, 3, 2} . Then A  B,
 Does not belong to
s.t.(: or |) Such that
because each element of A is an element of B and vice-versa.
 For every (7) Universal set : A set that contains all sets in a given
context is called the universal set.
 There exists
It should be noted that universal set is not unique. It may
iff If and only if
differ in problem to problem.
& And
(8) Power set : If S is any set, then the family of all the
a|b a is a divisor of b
subsets of S is called the power set of S.
N Set of natural numbers
The power set of S is denoted by P(S). Symbolically, P(S) =
I or Z Set of integers
{T : T  S}. Obviously  and S are both elements of P(S).
R Set of real numbers
Example : Let S = {a, b, c}, then P(S) = {  , {a}, {b}, {c},
C Set of complex numbers
Q Set of rational numbers
{a, b}, {a, c}, {b, c}, {a, b, c}}.
Power set of a given set is always non-empty.

1
 (9) Subsets (Set inclusion) : Let A and B be two sets. If (5) Symmetric difference of two sets : Let A and B be two
every element of A is an element of B, then A is called a subset of B. sets. The symmetric difference of sets A and B is the set
If A is subset of B, we write A  B, which is read as “A is a ( A  B)  (B  A) and is denoted by AB . Thus, AB =
subset of B” or “A is contained in B”. ( A  B)  (B  A)  {x : x  A  B} .
Thus, A  B  a  A  a  B. (6) Complement of a set : Let U be the universal set and
Proper and improper subsets : If A is a subset of B and let A be a set such that A  U. Then, the complement of A with
A  B, then A is a proper subset of B. We write this as A  B . respect to U is denoted by A or Ac or C(A) or U – A and is
The null set  is subset of every set and every set is subset of defined the set of all those elements of U which are not in A.
itself, i.e.,   A and A A for every set A. They are called Thus, A = {x  U : x  A}.
A U
improper subsets of A. Thus every non-empty set has two Clearly, x  A  x  A A
improper subsets. It should be noted that  has only one subset 
Example : Consider U  {1, 2,......, 10}
which is improper.
All other subsets of A are called its proper subsets. Thus, if and A  {1, 3, 5, 7, 9} .
A  B, A  B , A   , then A is said to be proper subset of B. Then A  {2, 4, 6, 8, 10}
Example : Let A  {1, 2} . Then A has  ; {1}, {2}, {1, 2} as its
subsets out of which  and {1, 2} are improper and {1} and {2} Some important results on number of elements
are proper subsets. in sets
Venn-Euler diagrams If A, B and C are finite sets and U be the finite universal set,
then (1) n(A  B) = n(A) + n(B) – n(A  B)
The combination of rectangles and circles are called Venn-
Euler diagrams or simply Venn-diagrams. (2) n(A  B) = n(A) + n(B)  A, B are disjoint non-void sets.
If A and B are not equal but they have (3) n(A – B) = n(A) – n(A  B) i.e., n(A – B) + n(A  B) = n(A)
some common elements, then to represent U (4) n(A  B) = Number of elements which belong to exactly
A and B we draw two intersecting circles. A one of A or B = n((A – B)  (B – A)) = n (A – B) + n(B – A)
Two disjoints sets are represented by two
non-intersecting circles. [ (A – B) and (B – A) are disjoint]

Operations on sets = n(A) – n(A  B) + n(B) – n(A  B) = n(A) + n(B) – 2n(A  B)

(5) n(A  B  C) = n(A) + n(B) + n(C) – n(A  B) – n(B 
(1) Union of sets : Let A and B be two sets. The union of A
C) – n(A  C) + n(A  B  C)
and B is the set of all elements which are in U
set A or in B. We denote the union of A and (6) n (Number of elements in exactly two of the sets A, B, C)
B by A  B , which is usually read as “A AB = n(A  B) + n(B  C) + n(C  A) – 3n(ABC)
union B”. (7) n(Number of elements in exactly one of the sets A, B, C) =
A B
Symbolically, n(A) + n(B) + n(C)
A  B  {x : x  A or x  B}. – 2n(A  B) – 2n(B  C) – 2n(A C) + 3n(A  B  C)
(2) Intersection of sets : Let A and B be two sets. The (8) n(A  B) = n(A  B) = n(U) – n(A  B)
intersection of A and B is the set of all those
U (9) n(A  B) = n(A  B) = n(U) – n(A  B)
elements that belong to both A and B.
The intersection of A and B is denoted AB
Laws of algebra of sets
by A  B (read as “A intersection B”).
A B (1) Idempotent laws : For any set A, we have
Thus, A  B = {x : x  A and x  B}.
(3) Disjoint sets : Two sets A and B are said to be disjoint, if (i) A  A = A (ii) A  A = A
A  B = . If A  B  , then A and B are said to be non- (2) Identity laws : For any set A, we have
intersecting or non-overlapping sets.
(i) A=A (ii) A  U = A
Example : Sets {1, 2}; {3, 4} are disjoint sets.
i.e.,  and U are identity elements for union and intersection
(4) Difference of sets : Let A and B be two sets. The
respectively.
difference of A and B written as A – B, is the set of all those
elements of A which do not belong to B. (3) Commutative laws : For any two sets A and B, we have
U U (i) A  B = B  A (ii) A  B = B  A
A–B B–A (iii) AB  BA
i.e., union, intersection and symmetric difference of two sets
A B A B are commutative.
Thus, A – B = {x : x  A and x  B} (iv) A  B  B  A (v) A  B  B  A
Similarly, the difference B  A is the set of all those elements of i.e., difference and cartesian product of two sets are not
B that do not belong to A i.e., B  A  {x  B : x  A} . commutative
Example : Consider the sets A  {1, 2, 3} and B  {3, 4, 5} , (4) Associative laws : If A, B and C are any three sets, then
then A  B  {1, 2}; B  A  {4, 5} . (i) (A  B)  C = A  (B  C) (ii) A  (B  C) = (A  B)  C

2
 (iii) ( AB)C  A(B C)
i.e., union, intersection and symmetric difference of two sets
Relations
are associative. Definition
(iv) ( A  B)  C  A  (B  C) (v) ( A  B)  C  A  (B  C)
Let A and B be two non-empty sets, then every subset of
i.e., difference and cartesian product of two sets are not A × B defines a relation from A to B and every relation from A to
associative. B is a subset of A × B.
(5) Distributive law : If A, B and C are any three sets, then Let R  A  B and (a, b)  R. Then we say that a is related to
(i) A  (B  C) = (A  B)  (A  C) b by the relation R and write it as a R b . If (a, b)  R , we write it
(ii) A  (B  C) = (A  B)  (A  C)
as a R b .
i.e., union and intersection are distributive over intersection
and union respectively. (1) Total number of relations : Let A and B be two non-
(iii) A  (B  C)  ( A  B)  ( A  C) empty finite sets consisting of m and n elements respectively. Then
A × B consists of mn ordered pairs. So, total number of subset of
(iv) A  (B  C)  ( A  B)  ( A  C) A × B is 2mn. Since each subset of A × B defines relation from A to
(v) A  (B  C)  ( A  B)  ( A  C) B, so total number of relations from A to B is 2mn. Among these 2mn
(6) De-Morgan’s law : If A, B and C are any three sets, then relations the void relation  and the universal relation A × B are
trivial relations from A to B.
(i) (A  B) = A  B
(ii) (A  B) = A  B (2) Domain and range of a relation : Let R be a relation
from a set A to a set B. Then the set of all first components or
(iii) A – (B  C) = (A – B)  (A – C) coordinates of the ordered pairs belonging to R is called the
(iv) A – (B  C) = (A – B)  (A – C) domain of R, while the set of all second components or
(7) If A and B are any two sets, then coordinates of the ordered pairs in R is called the range of R.
(i) A – B = A  B (ii) B – A = B  A Thus, Dom (R) = {a : (a, b)  R} and Range (R) = {b : (a, b)
(iii) A – B = A  A  B =  (iv) (A – B)  B = A  B  R}.
(v) (A – B)  B =  (vi) A  B  B  A
(vii) (A – B)  (B – A) = (A  B) – (A  B)
Inverse relation
(8) If A, B and C are any three sets, then Let A, B be two sets and let R be a relation from a set A to a
(i) A  (B – C) = (A  B) – (A  C) set B. Then the inverse of R, denoted by R–1, is a relation from B
(ii) A  (B  C) = (A  B)  (A  C) to A and is defined by R 1  {(b, a) : (a, b)  R}

Cartesian product of sets Clearly (a, b)  R  (b, a)  R–1. Also, Dom (R) = Range
(R ) and Range (R) = Dom (R 1 )
1
Cartesian product of sets : Let A and B be any two non-
empty sets. The set of all ordered pairs (a, b) such that a  A and b Example : Let A = {a, b, c}, B = {1, 2, 3} and R = {(a, 1),
 B is called the cartesian product of the sets A and B and is (a, 3), (b, 3), (c, 3)}.
denoted by A  B. Then, (i) R–1 = {(1, a), (3, a), (3, b), (3, c)}
Thus, A × B = [(a, b) : a  A and b  B]
(ii) Dom (R) = {a, b, c} = Range (R 1 )
If A =  or B = , then we define A × B = .
Example : Let A = {a, b, c} and B = {p, q}. (iii) Range (R) = {1, 3} = Dom (R 1 )
Then A × B = {(a, p), (a, q), (b, p), (b, q), (c, p), (c, q)}
Also B × A = {(p, a), (p, b), (p, c), (q, a), (q, b), (q, c)} Types of relations
Important theorems on cartesian product of sets : (1) Reflexive relation : A relation R on a set A is said to be
Theorem 1 : For any three sets A, B, C reflexive if every element of A is related to itself.
(i) A × (B  C) =(A × B)  (A × C) Thus, R is reflexive  (a, a)  R for all a  A.
(ii) A × (B  C) =(A × B)  (A × C) Example : Let A = {1, 2, 3} and R = {(1, 1); (1, 3)}
Theorem 2 : For any three sets A, B, C
Then R is not reflexive since 3  A but (3, 3)  R
A × (B – C) = (A × B) – (A × C)
A reflexive relation on A is not necessarily the identity relation
Theorem 3 : If A and B are any two non-empty sets, then on A.
A×B=B×AA=B
The universal relation on a non-void set A is reflexive.
Theorem 4 : If A  B, then A × A  (A × B)  (B × A)
(2) Symmetric relation : A relation R on a set A is said to
Theorem 5 : If A  B, then A × C  B × C for any set C.
be a symmetric relation iff (a, b)  R  (b, a)  R for all a, b  A
Theorem 6 : If A  B and C  D, then A × C  B × D
i.e., aRb  bRa for all a, b  A.
Theorem 7 : For any sets A, B, C, D
(A × B)  (C  D) = (A  C) × (B  D) it should be noted that R is symmetric iff R 1  R
Theorem 8 : For any three sets A, B, C The identity and the universal relations on a non-void set are
(i) A × (B  C) = (A × B)  (A × C) symmetric relations.
(ii) A × (B  C) = (A × B)  (A × C) A reflexive relation on a set A is not necessarily symmetric.

3
 (3) Anti-symmetric relation : Let A be any set. A relation R
on set A is said to be an anti-symmetric relation iff (a, b)  R and
Composition of relations
(b, a)  R  a = b for all a, b  A. Let R and S be two relations from sets A to B and B to C
Thus, if a  b then a may be related to b or b may be related respectively. Then we can define a relation SoR from A to C such
to a, but never both. that (a, c)  SoR   b  B such that (a, b)  R and (b, c)  S.
(4) Transitive relation : Let A be any set. A relation R on This relation is called the composition of R and S.
set A is said to be a transitive relation iff For example, if A = {1, 2, 3}, B = {a, b, c, d}, C={p, q, r, s}
(a, b)  R and (b, c)  R  (a, c)  R for all a, b, c  A i.e., be three sets such that R = {(1, a), (2, b), (1, c), (2, d)} is a
aRb and bRc  aRc for all a, b, c  A. relation from A to B and S = {(a, s), (b, r), (c, r)} is a relation from
B to C. Then SoR is a relation from A to C given by SoR = {(1, s)
Transitivity fails only when there exists a, b, c such that a R b,
(2, r) (1, r)}
b R c but a R c .
In this case RoS does not exist.
Example : Consider the set A = {1, 2, 3} and the relations
In general RoS  SoR. Also (SoR) –1 = R–1oS–1.
R1  {(1, 2), (1, 3)} ; R 2 = {(1, 2)}; R 3 = {(1, 1)};
R 4 = {(1, 2), (2, 1), (1, 1)}
Then R1 , R 2 , R 3 are transitive while R 4 is not transitive
since in R4 , (2, 1)  R4 ; (1, 2)  R4 but (2, 2)  R4 .
The identity and the universal relations on a non-void sets are
transitive.
(5) Identity relation : Let A be a set. Then the relation IA =
 Equal sets are always equivalent but equivalent sets may
{(a, a) : a  A} on A is called the identity relation on A. need not be equal set.
In other words, a relation I A on A is called the identity relation
 If A has n elements, then P(A) has 2n elements.
if every element of A is related to itself only. Every identity relation
will be reflexive, symmetric and transitive.  The total number of subset of a finite set containing n
elements is 2n.
Example : On the set = {1, 2, 3}, R = {(1, 1), (2, 2), (3, 3)}
is the identity relation on A .  If A1 , A2 ,......, An is a finite family of sets, then their union
It is interesting to note that every identity relation is reflexive n
but every reflexive relation need not be an identity relation. is denoted by  Ai or A1  A2  A3 ......  An .
i 1
(6) Equivalence relation : A relation R on a set A is said to
be an equivalence relation on A iff  If A1 , A2 , A3 ......., An is a finite family of sets, then their
n
(i) It is reflexive i.e. (a, a)  R for all a  A
intersection is denoted by  Ai or A1  A2  A3  ........  An .
(ii) It is symmetric i.e. (a, b)  R  (b, a)  R, for all a, b  A
i 1
(iii) It is transitive i.e. (a, b)  R and (b, c)  R  (a, c)  R
 R  Q is the set of all irrational numbers.
for all a, b, c  A.
Congruence modulo (m) : Let m be an arbitrary but fixed  Let A and B two non-empty sets having n elements in
integer. Two integers a and b are said to be congruence modulo m common, then A × B and B × A have n2 elements in common.
if a  b is divisible by m and we write a  b (mod m).  The identity relation on a set A is an anti-symmetric
Thus a  b (mod m)  a  b is divisible by m. For example, relation.
18  3 (mod 5) because 18 – 3 = 15 which is divisible by 5.  The universal relation on a set A containing at least two
Similarly, 3  13 (mod 2) because 3 – 13 = –10 which is divisible elements is not anti-symmetric, because if a  b are in A, then
by 2. But 25  2 (mod 4) because 4 is not a divisor of 25 – 3 = 22. a is related to b and b is related to a under the universal relation
The relation “Congruence modulo m” is an equivalence will imply that a = b but a  b.
relation.  The set {(a, a) : a  A}  D is called the diagonal line of
A  A . Then “the relation R in A is antisymmetric iff
Equivalence classes of an equivalence relation
R  R1  D ”.
Let R be equivalence relation in A(  ) . Let a  A . Then the
 The relation ‘is congruent to’ on the set T of all triangles in
equivalence class of a, denoted by [a] or {a } is defined as the set a plane is a transitive relation.
of all those points of A which are related to a under the relation R.
 If R and S are two equivalence relations on a set A , then
Thus [a] = {x  A : x R a}.
R  S is also an equivalence relation on A.
It is easy to see that
 The union of two equivalence relations on a set is not
(1) b  [a]  a  [b] necessarily an equivalence relation on the set.
(2) b  [a]  [a]  [b]  The inverse of an equivalence relation is an equivalence
(3) Two equivalence classes are either disjoint or identical. relation.

4
 10. Let A  [ x : x  R,| x | 1]; B  [ x : x  R,| x  1 | 1] and
A  B  R  D, then the set D is
(a) [ x : 1  x  2] (b) [ x : 1  x  2]
(c) [ x : 1  x  2] (d) None of these
11. If the sets A and B are defined as A  {(x, y) : y  e x , x  R} ;
Set theory B  {(x, y) : y  x, x  R}, then [UPSEAT 1994, 99, 2002]

1. The set of intelligent students in a class is [AMU 1998] (a) B  A (b) A  B

(a) A null set (c) A B  (d) A  B  A
(b) A singleton set 12. n
If X  {4  3n  1 : n  N } and Y  {9(n  1) : n  N}, then
(c) A finite set X  Y is equal to [Karnataka CET 1997]
(d) Not a well defined collection (a) X (b) Y
2. Which of the following is the empty set (c) N (d) None of these
[Karnataka CET 1990] 13. Let n(U )  700, n( A)  200, n(B)  300 and n( A  B)  100,
2
(a) {x : x is a real number and x  1  0} then n( Ac  Bc )  [Kurukshetra CEE 1999]
2
(b) {x : x is a real number and x  1  0} (a) 400 (b) 600
(c) {x : x is a real number and x 2  9  0} (c) 300 (d) 200
14. In a town of 10,000 families it was found that 40% family
(d) {x : x is a real number and x 2  x  2}
buy newspaper A, 20% buy newspaper B and 10% families
3. The set A  {x : x  R, x 2  16 and 2 x  6} equals buy newspaper C, 5% families buy A and B, 3% buy B and
C and 4% buy A and C. If 2% families buy all the three
[Karnataka CET 1995]
newspapers, then number of families which buy A only is
(a)  (b) {14, 3, 4} [Roorkee 1997]
(c) {3} (d) {4} (a) 3100 (b) 3300
4. If a set A has n elements, then the total number of subsets (c) 2900 (d) 1400
of A is [Roorkee 1991; Karnataka CET 1992, 2000] 15. In a city 20 percent of the population travels by car, 50
(a) n (b) n 2 percent travels by bus and 10 percent travels by both car
and bus. Then persons travelling by car or bus is
(c) 2n (d) 2n
[Kerala (Engg.) 2002]
5. The number of proper subsets of the set {1, 2, 3} is
(a) 80 percent (b) 40 percent
[JMIEE 2000]
(c) 60 percent (d) 70 percent
(a) 8 (b) 7
16. In a class of 55 students, the number of students studying
(c) 6 (d) 5
different subjects are 23 in Mathematics, 24 in Physics, 19 in
6. Given the sets A  {1, 2, 3}, B  {3,4} , C = {4, 5, 6}, then Chemistry, 12 in Mathematics and Physics, 9 in
A  (B  C) is [MNR 1988; Kurukshetra CEE 1996] Mathematics and Chemistry, 7 in Physics and Chemistry
and 4 in all the three subjects. The number of students who
(a) {3} (b) {1, 2, 3, 4}
have taken exactly one subject is [UPSEAT 1990]
(c) {1, 2, 4, 5} (d) {1, 2, 3, 4, 5, 6}
(a) 6 (b) 9
7. If A and B are any two sets, then A  ( A  B) is equal to
(c) 7 (d) All of these
[Karnataka CET 1996] 17. If A, B and C are any three sets, then A × (B  C) is equal
(a) A (b) B to [Pb. CET 2001]
(c) Ac (d) B c (a) (A × B)  (A × C) (b) (A  B) × (A  C)
8. If A and B are two given sets, then A  ( A  B)c is equal to (c) (A × B)  (A × C) (d) None of these
[AMU 1998; Kurukshetra CEE 1999] 18. If A, B and C are any three sets, then A – (B  C) is equal to
(a) A (b) B (a) (A – B)  (A – C) (b) (A – B)  (A – C)
(c) (A – B)  C (d) (A – B)  C
(c)  (d) A  Bc
19. If A, B and C are non-empty sets, then (A – B)  (B – A)
9. If the sets A and B are defined as equals [AMU 1992, 1998; DCE 1998]
1 (a) (A  B) – B (b) A – (A  B)
A  {(x, y) : y  , 0  x  R}
x
(c) (A  B) – (A  B) (d) (A  B)  (A  B)
B  {( x, y) : y   x, x  R} , then 20. If A  {2, 4, 5}, B  {7, 8, 9}, then n( A  B) is equal to
(a) AB A (b) A  B  B (a) 6 (b) 9
(c) AB  (d) None of these (c) 3 (d) 0

5
21. If the set A has p elements, B has q elements, then the 35. If A = {2, 3, 4, 8, 10}, B = {3, 4, 5, 10, 12},
number of elements in A × B is [Karnataka CET 1999] C = {4, 5, 6, 12, 14} then (A  B)  (A  C) is equal to
(a) p  q (b) p  q  1 (a) {3, 4, 10} (b) {2, 8, 10}
(c) pq (d) p 2 (c) {4, 5, 6} (d) {3, 5, 14}
22. If A  {a, b}, B  {c, d}, C  {d, e}, then 36. If A and B are any two sets, then A  (A  B) is equal to
(a) A (b) B
{(a, c), (a, d), (a, e), (b, c),(b, d),(b, e)} is equal to
(c) Ac (d) Bc
[AMU 1999; Him. CET 2002]
37. If A, B, C be three sets such that A  B = A  C and A  B
(a) A  (B  C) (b) A  (B  C)
= A  C, then [Roorkee 1991]
(c) A × (B  C) (d) A × (B  C)
(a) A = B (b) B = C
23. If P, Q and R are subsets of a set A, then R × (Pc  Qc)c =
(c) A = C (d) A = B = C
[Karnataka CET 1993]
38. Let A = {a, b, c}, B = {b, c, d}, C = {a, b, d, e}, then A 
(a) (R × P)  (R × Q) (b) (R  Q)  (R  P )
(B  C) is [Kurukshetra CEE 1997]
(c) (R  P )  (R  Q) (d) None of these (a) {a, b, c} (b) {b, c, d}
24. In rule method the null set is represented by (c) {a, b, d, e} (d) {e}
[Karnataka CET 1998] 39. If A and B are sets, then A  (B – A) is
(a) {} (b)  (a)  (b) A
(c) {x : x  x} (d) {x : x  x} (c) B (d) None of these
25. A  { x : x  x} represents [Kurukshetra CEE 1998] 40. If A and B are two sets, then A  ( A  B) is equal to
(a) {0} (b) {} (a) A (b) B
(c) {1} (d) {x} (c)  (d) None of these
 1  41. Let U  {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} , A  {1, 2, 5}, B  {6, 7} ,
26. If Q   x : x  , where y  N  , then
 y  then A  B is
(a) 0  Q (b) 1  Q (a) B (b) A
2 (c) A (d) B
(c) 2 Q (d)
Q
3 42. If A is any set, then
27. Which set is the subset of all given sets (a) A  A   (b) A  A  U
(a) {1, 2, 3, 4,......} (b) {1} (c) A  A  U (d) None of these
(c) {0} (d) {} 43. If N a  [an : n  N}, then N 5  N 7 
28. Let S  {0,1, 5, 4, 7} . Then the total number of subsets of S
[Kerala (Engg.) 2005]
is (a) N 7 (b) N
(a) 64 (b) 32
(c) N 35 (d) N 5
(c) 40 (d) 20
29. The number of non-empty subsets of the set {1, 2, 3, 4} is (e) N 12
[Karnataka CET 1997; AMU 1998] 44. If aN  {ax : x  N }, then the set 3 N  7 N is
(a) 15 (b) 14
(a) 21 N (b) 10 N
(c) 16 (d) 17
(c) 4 N (d) None of these
30. The smallest set A such that A  {1, 2} = {1, 2, 3, 5, 9} is
45. The shaded region in the given figure is [NDA 2000]
(a) {2, 3, 5} (b) {3, 5, 9} A
(c) {1, 2, 5, 9} (d) None of these (a) A  (B  C)
31. If A  B = B, then [JMIEE 2000] (b) A  (B  C)
(a) A  B (b) B  A (c) A  (B – C)
C B
(c) A   (d) B   (d) A – (B  C)
32. If A and B are two sets, then A  B  A  B iff 46. If A and B are two sets then (A – B)  (B – A)  (A  B) is
(a) A  B (b) B  A equal to
(a) A  B (b) A  B
(c) AB (d) None of these
(c) A (d) B
33. Let A and B be two sets. Then
47. Let A and B be two sets then ( A  B)  ( A  B) is equal to
(a) A  B  A  B (b) A  B  A  B
(a) A (b) A
(c) A  B = A  B (d) None of these (c) B (d) None of these
34. Let A  {( x, y) : y  e x , x  R} , B  {(x, y) : y  e  x , x  R}. 48. Let U be the universal set and A  B  C  U . Then
Then {( A  B)  (B  C)  (C  A)} is equal to
(a) A  B   (b) A  B   (a) A BC (b) A  (B  C)
(c) A B  R 2
(d) None of these (c) A BC (d) A  (B  C)

6
49. If n( A)  3 , n(B)  6 and A  B . Then the number of 58. In a class of 100 students, 55 students have passed in
elements in A  B is equal to Mathematics and 67 students have passed in Physics. Then
the number of students who have passed in Physics only is
(a) 3 (b) 9 [DCE 1993; ISM Dhanbad 1994]
(c) 6 (d) None of these (a) 22 (b) 33
50. Let A and B be two sets such that (c) 10 (d) 45
n( A)  0.16, n(B)  0.14, n( A  B)  0.25 . Then n( A  B) is 59. If A and B are two sets, then A × B = B × A iff
equal to [JMIEE 2001] (a) A  B (b) B  A
(a) 0.3 (b) 0.5 (c) A  B (d) None of these
60. If A and B be any two sets, then ( A  B) is equal to
(c) 0.05 (d) None of these
(a) A   (b) A  B
51. If A and B are disjoint, then n( A  B) is equal to
(c) A  B (d) A  B
(a) n(A) (b) n(B)
61. Let A and B be subsets of a set X. Then
(c) n( A)  n(B) (d) n( A) . n(B) (a) A  B  A  B (b) A  B  A  B
52. If A and B are not disjoint sets, then n( A  B) is equal to (c) A  B  Ac  B (d) A  B  A  Bc
62. Let A and B be two sets in the universal set. Then A  B
[Kerala (Engg.) 2001]
equals
(a) n( A)  n(B) (b) n( A)  n(B)  n( A  B)
(a) A  Bc (b) Ac  B
(c) n( A)  n(B)  n( A  B) (d) n( A) n(B) (c) A  B (d) None of these
(e) n( A)  n(B) 63. If A, B and C are any three sets, then A  ( B  C) is equal
to
53. In a battle 70% of the combatants lost one eye, 80% an ear, (a) ( A  B)  ( A  C) (b) ( A  B)  ( A  C)
75% an arm, 85% a leg, x% lost all the four limbs. The
(c) ( A  B)  C (d) ( A  B)  C
minimum value of x is
64. If A, B, C are three sets, then A  (B  C) is equal to
(a) 10 (b) 12
(a) (A  B)  (A  C) (b) (A  B)  (A  C)
(c) 15 (d) None of these
(c) (A  B)  (A  C) (d) None of these
54. Out of 800 boys in a school, 224 played cricket, 240 played 65. If A = {1, 2, 4}, B = {2, 4, 5}, C = {2, 5}, then (A – B) ×
hockey and 336 played basketball. Of the total, 64 played (B – C) is
both basketball and hockey; 80 played cricket and (a) {(1, 2), (1, 5), (2, 5)} (b) {(1, 4)}
basketball and 40 played cricket and hockey; 24 played all (c) (1, 4) (d) None of these
the three games. The number of boys who did not play any
66. If (1, 3), (2, 5) and (3, 3) are three elements of A × B and
game is [DCE 1995; MP PET 1996] the total number of elements in A  B is 6, then the
(a) 128 (b) 216 remaining elements of A  B are
(c) 240 (d) 160 (a) (1, 5); (2, 3); (3, 5) (b) (5, 1); (3, 2); (5, 3)
(c) (1, 5); (2, 3); (5, 3) (d) None of these
55. A survey shows that 63% of the Americans like cheese
whereas 76% like apples. If x% of the Americans like both 67. A = {1, 2, 3} and B = {3, 8}, then (A  B) × (A  B) is
cheese and apples, then (a) {(3, 1), (3, 2), (3, 3), (3, 8)}
(b) {(1, 3), (2, 3), (3, 3), (8, 3)}
(a) x  39 (b) x  63
(c) {(1, 2), (2, 2), (3, 3), (8, 8)}
(c) 39  x  63 (d) None of these (d) {(8, 3), (8, 2), (8, 1), (8, 8)}
56. 20 teachers of a school either teach mathematics or physics. 68. If A = {2, 3, 5}, B = {2, 5, 6}, then (A – B) × (A  B) is
12 of them teach mathematics while 4 teach both the subjects. (a) {(3, 2), (3, 3), (3, 5)} (b) {(3, 2), (3, 5), (3, 6)}
Then the number of teachers teaching physics only is (c) {(3, 2), (3, 5)} (d) None of these
(a) 12 (b) 8 69. In a class of 30 pupils, 12 take needle work, 16 take physics
(c) 16 (d) None of these and 18 take history. If all the 30 students take at least one
subject and no one takes all three then the number of pupils
57. Of the members of three athletic teams in a school 21 are in taking 2 subjects is [J & K 2005]
the cricket team, 26 are in the hockey team and 29 are in (a) 16 (b) 6
the football team. Among them, 14 play hockey and cricket, (c) 8 (d) 20
15 play hockey and football, and 12 play football and
70. If n( A)  4 , n(B)  3 , n( A  B  C)  24 , then n(C) 
cricket. Eight play all the three games. The total number of
[Kerala (Engg.) 2005]
members in the three athletic teams is
(a) 288 (b) 1
(a) 43 (b) 76
(c) 12 (d) 17
(c) 49 (d) None of these (e) 2

7
71. The number of elements in the set 79. Consider the following relations :
2 2
{(a, b) : 2a  3b  35, a, b  Z} , where Z is the set of all (1) A  B  A  ( A  B)
integers, is [Kerala (Engg.) 2005] (2) A  ( A  B)  ( A  B)
(a) 2 (b) 4 (3) A  (B  C)  ( A  B)  ( A  C)
(c) 8 (d) 12 which of these is/are correct [NDA 2003]
(e) 16 (a) 1 and 3 (b) 2 only
72. If A  {1, 2, 3, 4} ; B  {a, b} and f is a mapping such that (c) 2 and 3 (d) 1 and 2
f : A  B , then A  B is [DCE 2005] 80. If two sets A and B are having 99 elements in common, then
the number of elements common to each of the sets A  B
(a) {(a, 1), (3, b)} and B  A are [Kerala (Engg.) 2004]
(b) {(a, 2), (4, b)} (a) 299 (b) 99 2
(c) {(1, a), (1, b), (2, a), (2, b), (3, a), (3, b), (4, a), (4, b)} (c) 100 (d) 18
(d) None of these (e) 9
81. Given n(U)  20 , n( A)  12 , n(B)  9 , n( A  B)  4 ,
73. If A = {1, 2, 3, 4, 5}, B = {2, 4, 6}, C = {3, 4, 6}, then
where U is the universal set, A and B are subsets of U, then
( A  B)  C is [Orissa JEE 2004]
n(( A  B)C )  [Kerala (Engg.) 2004]
(a) {3, 4, 6} (b) {1, 2, 3}
(a) 17 (b) 9
(c) {1, 4, 3} (d) None of these (c) 11 (d) 3
74. If A = {x, y} then the power set of A is (e) 16
[Pb. CET 2004, UPSEAT 2000]
x
(a) {x , y } y Relations

(b) {, x, y} 1. Let A = {1, 2, 3}. The total number of distinct relations that
can be defined over A is
(c) {, {x}, {2y}}
(a) 29 (b) 6
(d) {, {x}, {y}, {x, y}}
(c) 8 (d) None of these
75. A set contains 2n  1 elements. The number of subsets of
2. Let X  {1, 2, 3, 4, 5} and Y  {1, 3, 5, 7, 9} . Which of the
this set containing more than n elements is equal to
following is/are relations from X to Y
[UPSEAT 2001, 04] (a) R1  {( x, y)| y  2  x, x  X , y  Y }
(a) 2n1 (b) 2n (b) R2  {(1, 1), (2,1), (3, 3), (4, 3), (5, 5)}
n 1 2n
(c) 2 (d) 2 (c) R3  {(1, 1), (1, 3)(3, 5), (3, 7), (5, 7)}
76. Which of the following is a true statement [UPSEAT 2005] (d) R4  {(1, 3), (2, 5),(2, 4), (7, 9)}
(a) {a}  {a, b, c} (b) {a}  {a, b, c} 3. Given two finite sets A and B such that n(A) = 2, n(B) = 3.
Then total number of relations from A to B is
(c)   {a, b, c} (d) None of these
(a) 4 (b) 8
77. If A = {x : x is a multiple of 4} and B = {x : x is a multiple
(c) 64 (d) None of these
of 6} then A  B consists of all multiples of [UPSEAT 2000]
4. The relation R defined on the set of natural numbers as {(a,
(a) 16 (b) 12 b) : a differs from b by 3}, is given by
(c) 8 (d) 4 (a) {(1, 4, (2, 5), (3, 6),.....} (b) {(4, 1), (5, 2), (6, 3),.....}
78. A class has 175 students. The following data shows the (c) {(1, 3), (2, 6), (3, 9),..} (d) None of these
number of students obtaining one or more subjects. 5. The relation R is defined on the set of natural numbers as
Mathematics 100, Physics 70, Chemistry 40; Mathematics {(a, b) : a = 2b}. Then R 1 is given by
and Physics 30, Mathematics and Chemistry 28, Physics and (a) {(2, 1), (4, 2), (6, 3).....} (b) {(1, 2), (2, 4), (3, 6)....}
Chemistry 23; Mathematics, Physics and Chemistry 18. How (c) R 1 is not defined (d) None of these
many students have offered Mathematics alone 6. The relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}
on set A = {1, 2, 3} is
[Kerala (Engg.) 2003]
(a) Reflexive but not symmetric
(a) 35 (b) 48 (b) Reflexive but not transitive
(c) 60 (d) 22 (c) Symmetric and Transitive
(e) 30 (d) Neither symmetric nor transitive

8
7. The relation “less than” in the set of natural numbers is 18. If R is a relation from a finite set A having m elements to a
[UPSEAT 1994, 98, 99; AMU 1999] finite set B having n elements, then the number of relations
from A to B is
(a) Only symmetric (b) Only transitive
(c) Only reflexive (d) Equivalence relation (a) 2mn (b) 2mn  1
(c) 2mn (d) mn
8. Let P  {(x, y)| x 2  y 2  1, x, y  R} . Then P is
19. Let R be a reflexive relation on a finite set A having
(a) Reflexive (b) Symmetric n-elements, and let there be m ordered pairs in R. Then
(c) Transitive (d) Anti-symmetric (a) m  n (b) m  n
9. Let R be an equivalence relation on a finite set A having n (c) m  n (d) None of these
elements. Then the number of ordered pairs in R is 20. The relation R defined on the set A = {1, 2, 3, 4, 5} by
(a) Less than n R = {(x, y) : | x 2  y 2 | 16} is given by
(b) Greater than or equal to n (a) {(1, 1), (2, 1), (3, 1), (4, 1), (2, 3)}
(c) Less than or equal to n (b) {(2, 2), (3, 2), (4, 2), (2, 4)}
(d) None of these (c) {(3, 3), (3, 4), (5, 4), (4, 3), (3, 1)}
10. For real numbers x and y, we write xRy  x  y  2 is an (d) None of these
21. A relation R is defined from {2, 3, 4, 5} to {3, 6, 7, 10} by
irrational number. Then the relation R is
xRy  x is relatively prime to y. Then domain of R is
(a) Reflexive (b) Symmetric
(a) {2, 3, 5} (b) {3, 5}
(c) Transitive (d) None of these
(c) {2, 3, 4} (d) {2, 3, 4, 5}
11. Let X be a family of sets and R be a relation on X defined by
22. Let R be a relation on N defined by x  2y  8 . The domain
‘A is disjoint from B’. Then R is
of R is
(a) Reflexive (b) Symmetric
(a) {2, 4, 8} (b) {2, 4, 6, 8}
(c) Anti-symmetric (d) Transitive (c) {2, 4, 6} (d) {1, 2, 3, 4}
12. If R is a relation from a set A to a set B and S is a relation 23. If R  {(x, y)| x, y  Z, x 2  y 2  4} is a relation in Z, then
from B to a set C, then the relation SoR
domain of R is
(a) Is from A to C (b) Is from C to A
(a) {0, 1, 2} (b) {0, – 1, – 2}
(c) Does not exist (d) None of these (c) {– 2, – 1, 0, 1, 2} (d) None of these
13. If R  A B and S  B C be two relations, then 24. R is a relation from {11, 12, 13} to {8, 10, 12} defined by
(SoR) 1
 y  x  3 . Then R 1 is

(a) S 1oR 1 (b) R 1oS 1 (a) {(8, 11), (10, 13)} (b) {(11, 18), (13, 10)}
(c) {(10, 13), (8, 11)} (d) None of these
(c) SoR (d) RoS
25. Let A = {1, 2, 3}, B = {1, 3, 5}. If relation R from A to B is
14. If R be a relation < from A = {1,2, 3, 4} to B = {1, 3, 5}
given by R ={(1, 3), (2, 5), (3, 3)}. Then R 1 is
i.e., (a, b)  R  a  b, then RoR 1 is
(a) {(3, 3), (3, 1), (5, 2)} (b) {(1, 3), (2, 5), (3, 3)}
(a) {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)} (c) {(1, 3), (5, 2)} (d) None of these
(b) {(3, 1) (5, 1), (3, 2), (5, 2), (5, 3), (5, 4)} 26. Let R be a reflexive relation on a set A and I be the identity
(c) {(3, 3), (3, 5), (5, 3), (5, 5)} relation on A. Then
(d) {(3, 3) (3, 4), (4, 5)} (a) R  I (b) I  R
(c) R  I (d) None of these
15. A relation from P to Q is
27. Let A = {1, 2, 3, 4} and R be a relation in A given by R =
(a) A universal set of P × Q
{(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (2, 1), (3, 1), (1, 3)}.
(b) P × Q Then R is
(c) An equivalent set of P × Q (a) Reflexive (b) Symmetric
(d) A subset of P × Q (c) Transitive (d) An equivalence relation
16. Let A = {a, b, c} and B = {1, 2}. Consider a relation R 28. An integer m is said to be related to another integer n if m is
defined from set A to set B. Then R is equal to set a multiple of n. Then the relation is
[Kurukshetra CEE 1995] (a) Reflexive and symmetric (b) Reflexive and transitive
(a) A (b) B (c) Symmetric and transitive (d) Equivalence relation
(c) A × B (d) B × A 29. The relation R defined in N as aRb  b is divisible by a is
17. Let n(A) = n. Then the number of all relations on A is (a) Reflexive but not symmetric
(b) Symmetric but not transitive
(a) 2n (b) 2(n)!
(c) Symmetric and transitive
2
(c) 2n (d) None of these (d) None of these

9
30. Let R be a relation on a set A such that R  R 1 , then R is 42. In order that a relation R defined on a non-empty set A is an
equivalence relation, it is sufficient, if R
(a) Reflexive (b) Symmetric
[Karnataka CET 1990]
(c) Transitive (d) None of these
(a) Is reflexive
31. Let R = {(a, a)} be a relation on a set A. Then R is
(b) Is symmetric
(a) Symmetric
(b) Antisymmetric (c) Is transitive

(c) Symmetric and antisymmetric (d) Possesses all the above three properties
(d) Neither symmetric nor anti-symmetric 43. The relation "congruence modulo m" is
32. The relation "is subset of" on the power set P(A) of a set A is (a) Reflexive only (b) Transitive only
(a) Symmetric (b) Anti-symmetric (c) Symmetric only (d) An equivalence relation
(c) Equivalency relation (d) None of these 44. Solution set of x  3 (mod 7), p  Z , is given by
33. The relation R defined on a set A is antisymmetric if (a) {3} (b) {7 p  3 : p  Z}
(a, b)  R  (b, a)  R for
(c) {7 p  3 : p  Z } (d) None of these
(a) Every (a, b)  R (b) No (a, b)  R
45. Let R and S be two equivalence relations on a set A. Then
(c) No (a, b), a  b, R (d) None of these (a) R  S is an equivalence relation on A
34. In the set A = {1, 2, 3, 4, 5}, a relation R is defined by (b) R  S is an equivalence relation on A
R = {(x, y)| x, y  A and x < y}. Then R is (c) R  S is an equivalence relation on A
(a) Reflexive (b) Symmetric (d) None of these
(c) Transitive (d) None of these 46. Let R and S be two relations on a set A. Then
35. Let A be the non-void set of the children in a family. The (a) R and S are transitive, then R  S is also transitive
relation x is a brother of y on A is
(b) R and S are transitive, then R  S is also transitive
(a) Reflexive (b) Symmetric
(c) R and S are reflexive, then R  S is also reflexive
(c) Transitive (d) None of these
(d) R and S are symmetric then R  S is also symmetric
36. Let A = {1, 2, 3, 4} and let R= {(2, 2), (3, 3), (4, 4), (1, 2)}
47. Let R = {(1, 3), (2, 2), (3, 2)} and S = {(2, 1), (3, 2), (2, 3)}
be a relation on A. Then R is
be two relations on set A = {1, 2, 3}. Then RoS =
(a) Reflexive (b) Symmetric
(a) {(1, 3), (2, 2), (3, 2), (2, 1), (2, 3)}
(c) Transitive (d) None of these
(b) {(3, 2), (1, 3)}
37. The void relation on a set A is
(c) {(2, 3), (3, 2), (2, 2)}
(a) Reflexive (b) Symmetric and transitive
(d) {(2, 3), (3, 2)}
(c) Reflexive and symmetric (d) Reflexive and transitive
48. Let L denote the set of all straight lines in a plane. Let a
38. Let R1 be a relation defined by R1  {(a, b)| a  b, a, b  R} .
relation R be defined by R    , ,   L . Then R is
Then R1 is [UPSEAT 1999]
(a) Reflexive (b) Symmetric
(a) An equivalence relation on R
(c) Transitive (d) None of these
(b) Reflexive, transitive but not symmetric
49. Let R be a relation over the set N × N and it is defined by
(c) Symmetric, Transitive but not reflexive
(a, b)R(c, d)  a  d  b  c. Then R is
(d) Neither transitive not reflexive but symmetric
(a) Reflexive only (b) Symmetric only
39. Which one of the following relations on R is an equivalence
relation (c) Transitive only (d) An equivalence relation
(a) a R1 b | a || b | (b) aR2b  a  b 50. Let n be a fixed positive integer. Define a relation R on the
set Z of integers by, aRb  n | a  b |. Then R is
(c) aR3 b  a divides b (d) aR4 b  a  b
(a) Reflexive (b) Symmetric
40. If R is an equivalence relation on a set A, then R 1 is
(c) Transitive (d) Equivalence
(a) Reflexive only
51. Let R  {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3, 12), (3, 6)}
(b) Symmetric but not transitive
be a relation on the set A  {3, 6, 9, 12} . The relation is
(c) Equivalence
[AIEEE 2005]
(d) None of these
(a) An equivalence relation
41. R is a relation over the set of real numbers and it is given by
nm  0 . Then R is (b) Reflexive and symmetric only
(a) Symmetric and transitive (b) Reflexive and symmetric (c) Reflexive and transitive only
(c) A partial order relation (d) An equivalence relation (d) Reflexive only

10
52. x 2  xy is a relation which is [Orissa JEE 2005] 6. If A  {x : x 2  5 x  6  0}, B  {2, 4}, C  {4, 5}, then
(a) Symmetric (b) Reflexive A  (B  C) is [Kerala (Engg.) 2002]
(c) Transitive (d) None of these (a) {(2, 4), (3, 4)} (b) {(4, 2), (4, 3)}
53. Let R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} be a relation on (c) {(2, 4), (3, 4), (4, 4)} (d) {(2,2), (3,3), (4,4), (5,5)}
the set A = {1, 2, 3, 4}. The relation R is [AIEEE 2004]
7. In a college of 300 students, every student reads 5
(a) Reflexive (b) Transitive
newspaper and every newspaper is read by 60 students. The
(c) Not symmetric (d) A function
no. of newspaper is [IIT 1998]
54. The number of reflexive relations of a set with four elements
(a) At least 30 (b) At most 20
is equal to [UPSEAT 2004]
(c) Exactly 25 (d) None of these
(a) 216 (b) 212
8 8. Let A = {1, 2, 3, 4, 5}; B = {2, 3, 6, 7}. Then the number
(c) 2 (d) 24
of elements in (A × B)  (B × A) is
55. Let S be the set of all real numbers. Then the relation R =
(a) 18 (b) 6
{(a, b) : 1 + ab > 0} on S is [NDA 2003]
(a) Reflexive and symmetric but not transitive (c) 4 (d) 0
(b) Reflexive and transitive but not symmetric 9. Let A = {1, 2, 3}, B = {1, 3, 5}. A relation R : A  B is
(c) Symmetric, transitive but not reflexive defined by R = {(1, 3), (1, 5), (2, 1)}. Then R 1 is defined
(d) Reflexive, transitive and symmetric by
(e) None of the above is true (a) {(1,2), (3,1), (1,3), (1,5)} (b) {(1, 2), (3, 1), (2, 1)}
56. If A is the set of even natural numbers less than 8 and B is (c) {(1, 2), (5, 1), (3, 1)} (d) None of these
the set of prime numbers less than 7, then the number of
10. Let R be the relation on the set R of all real numbers defined
relations from A to B is [NDA 2003]
by a R b iff | a  b | 1 . Then R is [Roorkee 1998]
(a) 29 (b) 9 2
2
(a) Reflexive and Symmetric (b) Symmetric only
(c) 3 (d) 29 1
(c) Transitive only (d) Anti-symmetric only
11. With reference to a universal set, the inclusion of a subset in
another, is relation, which is [Karnataka CET 1995]
(a) Symmetric only (b) Equivalence relation
(c) Reflexive only (d) None of these
12. Let R be a relation on the set N of natural numbers defined
1. If X  {8 n  7n  1 : n  N} and Y  {49(n  1) : n  N }, by nRm  n is a factor of m (i.e., n|m). Then R is
then (a) Reflexive and symmetric
(a) X  Y (b) Y  X
(b) Transitive and symmetric
(c) X  Y (d) None of these
(c) Equivalence
2. If N a  {an : n  N }, then N 3  N 4 
(d) Reflexive, transitive but not symmetric
(a) N 7 (b) N12
13. Let R and S be two non-void relations on a set A. Which of
(c) N3 (d) N 4 the following statements is false
3. Sets A and B have 3 and 6 elements respectively. What can (a) R and S are transitive  R  S is transitive
be the minimum number of elements in A  B
(b) R and S are transitive  R  S is transitive
[MNR 1987; Karnataka CET 1996]
(a) 3 (b) 6 (c) R and S are symmetric  R  S is symmetric
(c) 9 (d) 18 (d) R and S are reflexive  R  S is reflexive
4. 2 2
If A  [( x, y) : x  y  25] 14. Let a relation R be defined by R = {(4, 5); (1, 4); (4, 6);
(7, 6); (3, 7)} then R 1oR is
and B = [(x, y) : x 2  9 y 2  144] , then A  B contains
(a) {(1, 1), (4, 4), (4, 7), (7, 4), (7, 7), (3, 3)}
[AMU 1996; Pb. CET 2002]
(a) One point (b) Three points (b) {(1, 1), (4, 4), (7, 7), (3, 3)}
(c) Two points (d) Four points (c) {(1, 5), (1, 6), (3, 6)}
5. If A  [ x : x is a multiple of 3] and B  [ x : x is a multiple (d) None of these
of 5], then A – B is ( A means complement of A) 15. Let R be a relation on the set N be defined by {(x, y)| x, y 
[AMU 1998] N, 2x + y = 41}. Then R is
(a) AB (b) A  B (a) Reflexive (b) Symmetric
(c) AB (d) A  B (c) Transitive (d) None of these

11
 Set theory Set theory
1. (d) Since, intelligency is not defined for students in a class
1 d 2 b 3 a 4 c 5 c
i.e., Not a well defined collection.
6 b 7 a 8 d 9 c 10 b
2. (b) Since x 2  1  0, gives x 2  1  x  i
11 c 12 b 13 c 14 b 15 c  x is not real but x is real (given)
16 d 17 a 18 b 19 c 20 b  No value of x is possible.
21 c 22 c 23 a,b 24 d 25 b 3. (a) x 2  16  x  4
26 b 27 d 28 b 29 a 30 b
2x  6  x  3
There is no value of x which satisfies both the above
31 b 32 c 33 b 34 b 35 a equations. Thus, A   .
36 a 37 b 38 a 39 a 40 c
4. (c) Number of subsets of A  nC0  nC1  .........  nCn  2n .
41 b 42 b 43 c 44 a 45 d
5. (c) Number of proper subsets of the set {1, 2, 3)
46 a 47 a 48 c 49 c 50 c 3
=2  2  6.
51 c 52 b 53 a 54 d 55 c 6. (b) B  C  {4} ,  A  (B  C) = {1, 2, 3, 4}.
56 a 57 a 58 d 59 c 60 b 7. (a) A  B  A . Hence A  ( A  B)  A .
61 d 62 a 63 a 64 b 65 b 8. (d) A  ( A  B)c  A  ( Ac  B c )
66 a 67 b 68 c 69 a 70 e = ( A  Ac )  ( A  Bc ) =   ( A  Bc )  A  Bc .
71 c 72 c 73 a 74 d 75 d 1 1
9. (c) Since y  , y   x meet when  x   x 2  1 ,
76 a 77 b 78 c 79 d 80 b x x
81 d which does not give any real value of x.
Hence, A  B   .
Relations 10. (b) A  [ x : x  R,  1  x  1]
B  [ x : x  R : x  1  1 or x  1  1]
1 a 2 a,b,c 3 c 4 b 5 b
= [ x : x  R : x  0 or x  2]
6 a 7 b 8 b 9 b 10 a  A  B  R  D , where D = [ x : x  R, 1  x  2] .
11 b 12 a 13 b 14 c 15 d
11. (c) Since, y  e x and y  x do not meet for any x  R
16 c 17 c 18 a 19 a 20 d  A B  .
21 d 22 c 23 c 24 a 25 a
12. (b) Since, 4 n  3n  1  (3  1)n  3n  1
26 b 27 a,b 28 b 29 a 30 b
 3 n  n C1 3n1  nC 2 3 n2  .....  nCn1 3  nCn  3n  1
31 c 32 b 33 c 34 c 35 bc
 n C 2 3 2  n C 3 .3 3  ...  n C n 3 n , (n C0  n Cn , n C1  n Cn1 etc.)
36 c 37 b 38 b 39 a 40 c
 9[nC2  nC3 (3)  .....  nCn 3n1]
41 d 42 d 43 d 44 c 45 b
a,b,c,d
 4 n  3n  1 is a multiple of 9 for n  2 .
46 b,c,d 47 c 48 b 49 d 50
For n  1, 4 n  3n  1 = 4  3  1  0 ,
51 c 52 b 53 c 54 d 55 a
For n  2, 4 n  3n  1 = 16  6  1  9
56 a
 4 n  3n  1 is a multiple of 9 for all n  N
Critical Thinking Questions  X contains elements, which are multiples of 9, and
clearly Y contains all multiples of 9.
 X  Y i.e., X  Y  Y .
1 a 2 b 3 b 4 d 5 b
c c
6 a 7 c 8 c 9 c 10 a 13. (c) n( A  B ) = n[(A  B)c] = n(U )  n( A  B)
= n(U )  [n( A)  n( B)  n( A  B)]
11 d 12 d 13 a 14 a 15 d
= 700 – [200 + 300 – 100] = 300.

12
14. (b) n(A) = 40% of 10,000 = 4,000 29. (a) The number of non- empty subsets = 2 n  1
n(B) = 20% of 10,000 = 2,000 2 4  1  16  1  15 .
n(C) = 10% of 10,000 = 1,000 30. (b) Given A  {1, 2}  {1, 2, 3, 5, 9} . Hence, A  {3, 5,9} .
n (A  B) = 5% of 10,000 = 500 31. (b) Since A  B  B,  B  A .
n (B  C) = 3% of 10,000 = 300 32. (c) Let x  A  x  A  B , [ A  A  B]
n(C  A) = 4% of 10,000 = 400
 x  A  B , [ A  B  A  B]
n(A  B  C) = 2% of 10,000 = 200
 x  A and x  B  x  B ,  A  B
We want to find n(A  Bc  Cc) = n[A  (B  C)c]
Similarly, x  B  x  A ,  B  A
= n(A) – n[A  (B  C)] = n(A) – n[(A  B)  (A  C)]
Now A  B, B  A  A  B .
= n(A) – [n(A  B) + n(A  C) – n(A  B  C)]
33. (b) A  B  A  A  B ,  A  B  A  B .
= 4000 – [500 + 400 – 200] = 4000 – 700 = 3300.
15. (c) n(C) = 20, n(B) = 50, n(C  B) = 10 34. (b)  y  e x , y  e  x will meet, when e x  e  x
Now n(C  B) = n(C) + n(B) – n(C  B)  e 2 x  1,  x  0, y  1
= 20 + 50 – 10 = 60.  A and B meet on (0, 1),  A  B   .
Hence, required number of persons = 60%. 35. (a) A  B  {2, 3, 4, 8, 10}  {3, 4, 5, 10, 12}
16. (d) n(M) = 23, n(P) = 24, n(C)= 19
 {3, 4, 10} , A  C  {4} .
n(M  P) = 12, n(M  C)= 9, n(P  C)= 7
 ( A  B)  ( A  C)  {3, 4, 10} .
n(M  P  C) = 4
36. (a) A  ( A  B)  A , [ A  B  A] .
We have to find n(M  P  C), n(P  M   C ),
n ( C  M   P ) 37. (b) It is obvious.
38. (a) B  C  {a, b, c, d, e}
Now n (M  P  C) = n[M  (P  C)]
= n(M)– n(M  (P  C))  A  (B  C)  {a, b, c}  {a, b, c, d, e }  {a, b, c} .
= n( M )  n[(M  P )  (M  C)] 39. (a) A  (B  A)   , [ x  B  A  x   A] .
= n(M) – n(M  P)– n(M  C) + n(M  P  C) 40. (c) A  ( A  B)  A  ( A  B ) , ( ( A  B)  A   B  )
= 23 –12 – 9 + 4 = 27 –21 = 6  ( A  A )  B  , (by associative law)
n(P  M  C) = n[P  (M  C)]    B , ( A  A    )
= n(P)– n[P  (M  C)] = n( P)  n[(P  M )  (P  C)]  .
= n(P) – n(P  M) – n(P  C) + n(P  M  C) 41. (b) B   {1, 2, 3, 4, 5, 8 ,9, 10}
= 24 – 12 – 7 + 4 = 9  A  B  {1, 2, 5}  {1, 2, 3, 4, 5, 8, 9, 10}  {1, 2, 5}  A
n(C  M   P )  n(C)  n(C  P)  n(C  M )  n(C  P  M )
42. (b) It is obvious.
= 19 – 7 – 9 + 4 = 23 – 16 = 7. 43. (c) N 5  N 7  N 35 ,
17. (a) It is distributive law.
[  5 and 7 are relatively prime numbers].
18. (b) It is De' Morgan law. 44. (a) 3 N  {x  N : x is a multiple of 3}
19. (c) (A – B)  (B – A) = (A  B) – (A  B).
7 N  {x  N : x is a multiple of 7}
20. (b) A × B = {(2, 7), (2, 8), (2, 9), (4, 7), (4, 8), (4, 9),
 3 N  7 N  {x  is a multiple of 3 and 7}
(5, 7), (5, 8), (5, 9)}
n(A × B) = n(A) . n(B) = 3 × 3 = 9.  {x  N : x is a multiple of 3 and 7}
21. (c) n( A  B)  pq .  {x  N : x is a multiple of 21}=21N.
22. (c) B  C = {c, d}  (d, e} = {c, d, e} 45. (d) It is obvious.
46. (a) From Venn-Euler's diagram,
 A × (B  C) = {a, b} × {c, d, e}
= {(a, c), (a, d), (a, e), (b, c), (b, d), (b, e)}. U
23. (a,b) R  (P c  Qc )c  R  [(P c )c  (Qc )c ]
AB

A–B B–A
= R  ( P  Q)  (R  P )  (R  Q) = (R  Q)  (R  P ) .
24. (d) It is fundamental concept.
25. (b) It is fundamental concept.
1 1 1 2  ( A  B)  (B  A)  ( A  B)  A  B .
26. (b) Since  0,  2,  , [ y  N ]
y y y 3 47. (a) From Venn-Euler's Diagram,
1 (AB)' U
 can be 1, [  y can be 1].
y
27. (d) Null set is the subset of all given sets. (A'B)
28. (b) S  {0, 1, 5, 4, 7} ,
A B
then, total number of subsets of S is 2 n .
Hence, 2 5  32 .  ( A  B)  ( A  B)  A .

13
48. (c) From Venn-Euler's Diagram, 57. (a) Let B, H, F denote the sets of members who are on the
basketball team, hockey team and football team
C U
C–A respectively.
ABC
Then we are given n (B)  21, n (H)  26, n (F )  29
n (H  B)  14 , n (H  F )  15 , n ( F  B)  12
A–B B–C
and n (B  H  F )  8 .
A B
We have to find n (B  H  F ) .
Clearly, {( A  B)  (B  C)  (C  A)}  A  B  C .
To find this, we use the formula
49. (c) Since A  B,  A  B  B .
n (B  H  F )  n (B)  n (H )  n (F )
So, n( A  B)  n(B)  6 .
n (B  H)  n (H  F )  n (F  B)  n (B  H  F )
50. (c) n( A  B)  n( A)  n(B)  n( A  B)
Hence, n ( B  H  F )  (21  26  29)  (14  15  12)  8  43
0.25  0.16  0.14  n( A  B)
Thus these are 43 members in all.
 n( A  B)  0.30  0.25  0.05 .
58. (d) n (M )  55, n (P )  67, n (M  P )  100
51. (c) Since A and B are disjoint,  A  B  
Now, n (M  P )  n (M )  n (P )  n (M  P )
n( A  B)  0
100  55  67  n (M  P )
Now n ( A  B)  n( A)  n(B)  n( A  B)
 n( A)  n(B)  0  n( A)  n(B) .  n (M  P )  122  100  22

52. (b) n( A  B)  n( A)  n (B)  n( A  B) . Now n (P only) = n (P )  n(M  P )  67  22  45 .

53. (a) Minimum value of n  100  (30  20  25  15)) 59. (c) In general, A  B  B  A
A  B  B  A is true, if A = B.
 100  90  10 .
60. (b) From De’ morgan’s law, ( A  B)  A  B  .
54. (d) n (C)  224, n (H )  240, n (B)  336
61. (d) A  B  { x : x  A and x  B}
n (H  B)  64, n(B  C)  80
 {x : x  A and x  B c }  A  B c .
n( H  C)  40 , n(C  H  B)  24
62. (a) It is obvious.
n (C c  H c  B C )  n [(C  H  B)c ]
63. (a) From De’ morgan’s law, A  ( B  C)  ( A  B)  ( A  C) .
 n()  n(C  H  B)
64. (b) From Distributive law, A  (B  C)  ( A  B)  ( A  C) .
 800  [n(C)  n( H)  n(B)  n(H  C) 65. (b) A  B  {1} and B  C  {4}
n(H  B)  n(C  B)  n(C  H  B)] ( A  B)  (B  C)  {(1, 4)} .
 800  [224  240  336  64  80  40  24] 66. (a) It is obvious.
 800  640  160 . 67. (b) A  B  {1, 2, 3, 8} ; A  B  {3}
55. (c) Let A denote the set of Americans who like cheese and
( A  B)  ( A  B)  {(1, 3), (2,3), (3,3), (8,3)} .
let B denote the set of Americans who like apples.
Let Population of American be 100. 68. (c) A  B  {3}, A  B  {2,5}
Then n ( A)  63, n (B)  76 ( A  B)  ( A  B)  {(3, 2); (3, 5)} .
Now, n ( A  B)  n( A)  n(B)  n( A  B) 69. (a) Given n( N )  12 , n( P)  16 , n( H)  18 ,
 63  76  n( A  B) n( N  P  H )  30
 n ( A  B)  n( A  B)  139 From, n( N  P  H)  n( N )  n(P )  n(H )  n( N  P)
 n ( A  B)  139  n( A  B) n(P  H )  n( N  H )  n( N  P  H )
But n ( A  B)  100  n( N  P )  n(P  H )  n( N  H )  16
Now, number of pupils taking two subjects
 n ( A  B)  100
 n( N  P )  n(P  H )  n( N  H )  3n( N  P  H )
 139  n ( A  B)  139  100  39
 16  0  16 .
 n( A  B)  39 i.e., 39  n( A  B) .....(i) 70. (e) n( A)  4 , n(B)  3
Again, A  B  A, A  B  B n( A)  n(B)  n(C)  n( A  B  C)
 n ( A  B)  n ( A)  63 and n ( A  B)  n (B)  76 24
4  3  n(C)  24  n(C)  2.
 n( A  B)  63 …..(ii) 12
Then, 39  n ( A  B)  63  39  x  63 . 71. (c) Given set is {(a, b) : 2a 2  3b 2  35, a, b  Z}
56. (a) Let n (P ) = Number of teachers in Physics.
We can see that, 2(2)2  3(3)2  35
n (M ) = Number of teachers in Maths
and 2(4)2  3(1)2  35
n (P  M )  n(P )  n ( M )  n (P  M )
 (2, 3), (2, –3), (–2, –3), (–2, 3), (4, 1), (4, –1),
20  n (P )  12  4  n ( P )  12 . (–4, –1), (–4, 1) are 8 elements of the set.  n  8 .

14
72. (c) It is obvious. 4. (b) R  {(a, b) : a, b  N , a  b  3}  {((n  3), n) : n  N }
73. (a) A  B  {1, 2, 3, 4, 5, 6}  {(4, 1), (5, 2), (6, 3), .....} .
 ( A  B)  C  {3, 4, 6} . 5. (b) R = {(2, 1), (4, 2), (6, 3),......}.
74. (d) It is obvious. So, R 1 = {(1, 2), (2, 4), (3, 6),.....}.
75. (d) Let the original set contains (2n  1) elements, then 6. (a) Since (1, 1); (2, 2); (3, 3)  R therefore R is reflexive.
subsets of this set containing more than n elements, i.e., (1, 2)  R but (2, 1)  R, therefore R is not symmetric.
subsets containing (n  1) elements, (n  2) elements, It can be easily seen that R is transitive.
……. (2n  1) elements. 7. (b) Since x  y, y  z  x  z  x, y, z  N
 Required number of subsets  x R y, yR z  x R z ,  Relation is transitive,
 2n 1Cn 1  2n 1Cn 2  ....  2n 1C2n  2n 1C2n 1  x  y does not give y  x ,
 2n  1
Cn  2n 1
Cn1  ...  2n  1
C1  2n  1
C0  Relation is not symmetric.
2n 1 2n 1 2n 1 2n  1 2n 1
Since x  x does not hold, hence relation is not
 C0  C1  C2  ...  Cn1  Cn reflexive.
1 1 8. (b) Obviously, the relation is not reflexive and transitive but

2
 2

(1  1)2 n  1  [ 22 n 1 ]  22n .
it is symmetric, because x 2  y 2  1  y 2  x 2  1 .
76. (a) It is obvious. 9. (b) Since R is an equivalence relation on set A,
77. (b) A  {4, 8, 12, 16, 20, 24, .....} therefore (a, a)  R for all a  A . Hence, R has at least n
B  {6, 12, 18, 24, 30, ....} ordered pairs.

 A  B  {12, 24, ....} = {x : x is a multiple of 12}. 10. (a) For any x  R, we have x  x  2  2 an irrational
number.
78. (c) n(M alone)  n(M )  n(M  C)  n(M  P )  n( M  P  C)
 xRx for all x. So, R is reflexive.
M P
R is not symmetric, because 2R1 but 1 R 2 , R is
not transitive also because 2 R1 and 1R 2 2
but 2 R 2 2 .
C
11. (b) Clearly, the relation is symmetric but it is neither
 100  28  30  18  60 . reflexive nor transitive.
79. (d) A  B  A  ( A  B) is correct. 12. (a) It is obvious.
A  ( A  B)  ( A  B) is correct. 13. (b) It is obvious.
A B 14. (c) We have, R = {(1, 3); (1, 5); (2, 3); (2, 5); (3, 5); (4, 5)}
R 1  {(3, 1), (5, 1), (3, 2), (5, 2); (5, 3); (5, 4)}
Hence RoR 1 = {(3, 3); (3, 5); (5, 3); (5, 5)}.
15. (d) A relation from P to Q is a subset of P  Q .
A–B A – (A  B)
(3) is false. 16. (c) R  A  B .
 (1) and (2) are true. 17. (c) Number of relations on the set A  Number of subsets
80. (b) n(( A  B)  (B  A)) 2
of A  A  2 n , [ n( A  A)  n 2 ] .
 n(( A  B)  (B  A))  n( A  B).n(B  A) 18. (a) It is obvious.
 n( A  B).n( A  B)  (99)(99)  99 2 . 19. (a) Since R is reflexive relation on A, therefore (a, a)  R for
81. (d) n( A  B)  n( A)  n(B)  n( A  B)  12  9  4  17 all a  A .
The minimum number of ordered pairs in R is n.
Now, n(( A  B)C )  n(U )  n( A  B)  20  17  3 .
Hence, m  n .
Relations 20. (d) Here R  {(x, y) :| x 2  y 2 | 16}
1. (a) n( A  A)  n( A).n( A)  3 2  9 and given A  {1, 2, 3, 4, 5}

So, the total number of subsets of A  A is 29 and a  R  {(1, 2) (1, 3) (1, 4); (2, 1) (2, 2) (2, 3)(2, 4); (3, 1) (3, 2)
subset of A A is a relation over the set A. (3, 3)(3, 4); (4, 1) (4, 2)(4, 3); (4, 4) (4, 5), (5, 4) (5, 5)} .
2. (a,b,c) R4 is not a relation from X to Y, because (7, 9)  R4 21. (d) Given, xRy  x is relatively prime to y.
but (7, 9)  X  Y .  Domain of R  {2, 3, 4, 5} .
3. (c) Here n( A  B) = 2 × 3 = 6
22. (c) R be a relation on N defined by x  2y  8 .
Since every subset of A × B defines a relation from A to
B, number of relation from A to B is equal to number of  R{( 2, 3); (4, 2); (6, 1)}
subsets of A  B  26  64 . Hence, Domain of R  {2, 4, 6} .

15
23. (c)  R  {( x, y) | x, y  Z , x 2  y 2  4} 41. (d) It is obvious.
42. (d) It is obvious.
 R  {(2, 0), (1, 0), (1, 1), (0,  1)(0, 1), (0, 2), (0,2)
43. (d) It is obvious.
(1, 0), (1, 1), (2, 0)} 44. (c) x  3 (mod 7)  x  3  7 p, ( p  z)
Hence, Domain of R  {2,  1, 0, 1, 2 } .  x  7 p  3, p  z i.e., {7 p  3 : p  z ) .
24. (a) R is a relation from {11, 12, 13}to {8, 10, 12} defined 45. (b) Given, R and S are relations on set A.
by y  x  3  x  y  3  R  A  A and S  A  A  R  C  A  A
 R = {11, 8},{13, 10}.  R  S is also a relation on A.
Hence, R 1  {8, 11};{10, 13} . Reflexivity : Let a be an arbitrary element of A. Then,
a  A  (a, a)  R and (a, a)  S ,
25. (a) It is obvious.
[  R and S are reflexive]
26. (b) It is obvious.
 (a, a)  R  S
27. (a,b) (1, 1)(2, 2)(3, 3)(4, 4)  R ;  R is reflexive.
 (1, 2) (3, 1)  R and also (2, 1)(1, 3)  R . Thus, (a, a)  R  S for all a  A .
Hence, R is symmetric. But clearly R is not transitive. So, R  S is a reflexive relation on A.
28. (b) For any integer n, we have n | n  n R n Symmetry : Let a, b  A such that (a, b)  R  S .
So, n R n for all n  Z  R is reflexive Then, (a, b)  R  S  (a, b)  R and (a, b)  S
 (b, a)  R and (b, a)  S ,
Now 2|6 but 6+2, (2,6)  R but (6, 2)  R
[  R and S are symmetric]
So, R is not symmetric.
 (b, a)  R  S
Let (m, n)  R and (n, p)  R .
Thus, (a, b)  R  S
(m, n)  R  m | n
Then   m | p  (m, p)  R  (b, a)  R  S for all (a, b)  R  S .
(n, p)  R  n | p  So, R  S is symmetric on A.
So, R is transitive. Transitivity : Let a, b, c  A such that (a, b)  R  S and
Hence, R is reflexive and transitive but it is not (b, c)  R  S . Then, (a, b)  R  S and (b, c)  R  S
symmetric.
 {((a, b)  R and (a, b)  S )}
29. (a) For any a  N , we find that a|a, therefore R is
reflexive but R is not transitive, because aRb does not and {((b, c)  R and (b,c)  S}
imply that bRa .  {(a, b)  R, (b, c)  R} and {(a, b)  S, (b, c)  S}
30. (b) Let (a, b)  R  (a, c)  R and (a, c)  S
Then, (a, b)  R  (b, a)  R 1 , [By def. of R 1 ]  R and S are transitive So

(a,b)  R and (b,c)  R  (a, c)  R
1
 (b, a)  R , [ R  R ]
So, R is symmetric. (a,b)  S and (b, c)  S  (a, c)  S
31. (c) It is obvious.  (a, c)  R  S
32. (b) The relation is not symmetric, because A  B does not Thus, (a, b)  R  S and (b, c)  R  S  (a, c)  R  S .
imply that B  A . But it is anti-symmetric because So, R  S is transitive on A.
A  B and B  A  A=B. Hence, R is an equivalence relation on A.
33. (c) It is obvious. 46. (b, c, d) These are fundamental concepts.
34. (c) Since x  x, therefore R is not reflexive. Also x  y 47. (c) Here R  {(1, 3), (2, 2); (3, 2)} , S  {(2, 1); (3, 2); (2, 3)}
does not imply that y  x, So R is not symmetric. Let Then RoS  {(2, 3); (3, 2); (2,2)} .
x R y and y R z . Then, x  y and y  z  x  z i.e., 48. (b) Here R          
x R z . Hence R is transitive. Hence, R is symmetric.
35. (b,c) x is a brother of y, y is also brother of x. 49. (d) We have (a, b)R(a, b) for all (a, b)  N  N
So, it is symmetric. Clearly it is transitive. Since a  b  b  a . Hence, R is reflexive.
36. (c) Since (1, 1)  R so, is not reflexive. R is symmetric for we have (a, b)R(c, d)  a  d  b  c
Now (1, 2)  R but (2,1)  R , therefore R is not  d  a  c  b  c  b  d  a  (c, d)R(e, f ).
symmetric Clearly R is transitive. Then by definition of R, we have
37. (b) The void relation R on A is not reflexive as (a, a)  R for a  d  b  c and c  f  d  e ,
any a  A . The void relation is symmetric and whence by addition, we get
transitive. a  d  c  f  b  c  d  e or a  f  b  e
38. (b) For any a  R , we have a  a, Therefore the relation R Hence, (a, b) R (e, f )
is reflexive but it is not symmetric as (2, 1)  R but Thus, (a, b) R(c, d) and (c, d)R(e, f )  (a, b)R (e, f ) .
(1, 2)  R . The relation R is transitive also, because
50. (a,b,c,d) It is obvious.
(a, b)  R, (b, c)  R imply that a  b and b  c which is
51. (c) Here (3, 3), (6, 6), (9, 9), (12, 12), [Reflexive];
turn imply that a  c .
(3, 6), (6, 12), (3, 12), [Transitive].
39. (a) It is obvious.
40. (c) It is obvious. Hence, reflexive and transitive only.

16
52. (b) It is obvious. 5. (b) A – B = A  Bc = A  B .
53. (c) Given A = {1, 2, 3, 4} 6. (a) Clearly, A = {2, 3}, B = {2, 4}, C = {4, 5}
R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} B  C = {4}
(2, 3)  R but (3, 2)  R. Hence R is not symmetric.  A × (B  C) = {(2, 4); (3, 4)}.
R is not reflexive as (1, 1)  R. 7. (c) Let number of newspapers be x. If every students reads
R is not a function as (2, 4)  R and (2, 3)  R. one newspaper, the number of students would be
R is not transitive as (1, 3)  R and (3, 1)  R but (1, 1) x(60)  60 x
 R. Since, every students reads 5 newspapers
54. (d) Total number of reflexive relations in a set with n x  60
 Numbers of students   300 , x  25 .
elements  2n . 5
Therefore, total number of reflexive relation set with 4 8. (c) Here A and B sets having 2 elements in common, so
elements  24 . A  B and B  A have 22 i.e., 4 elements in common.
55. (a) Since 1  a.a  1  a 2  0 , a  S ,  (a, a)  R Hence, n [( A  B)  (B  A)]  4 .
 R is reflexive. 9. (c) ( x, y)  R  (y, x )  R 1 ,  R 1  {(3,1), (5, 1),(1, 2)} .
Also (a, b)  R  1  ab  0  1  ba  0  (b, a)  R , 10. (a) | a  a | 0  1 a R a  a  R
 R is symmetric.  R is reflexive.
 (a, b)  R and (b, c)  R need not imply (a, c)  R . Again a R b  | a  b | 1 | b  a | 1  bRa
Hence, R is not transitive. 1 1 1
 R is symmetric, Again 1R and R1 but  1
56. (a) A  {2, 4, 6} ; B  {2, 3, 5} 2 2 2
 A  B contains 3  3  9 elements.  R is not anti-symmetric.
9 Further, 1 R 2 and 2 R 3 but 1 R 3 , [ |1  3| 2  1 ]
Hence, number of relations from A to B  2 .
 R is not transitive.
11. (d) Since A  A .  Relation ' ' is reflexive.
Critical Thinking Questions Since A  B, B  C  A  C
 Relation ' ' is transitive.
1. (a) Since 8 n  7n  1  (7  1)n  7n  1
But A  B,  B  A ,  Relation is not symmetric.
 7 n  nC1 7 n 1  nC2 7 n  2  .....  nCn 1 7  nCn  7n  1 12. (d) Since n | n for all n  N , therefore R is reflexive. Since
 nC2 7 2  nC3 7 3  ..  nCn 7 n , (n C0  nCn , nC1  nCn 1 etc.) 2 | 6 but 6 | 2 , therefore R is not symmetric.
Let n R m and m R p  n|m and m|p  n|p  nRp.
 49[n C2  nC3 (7)  ......  nCn 7 n  2 ]
So, R is transitive.
 8 n  7n  1 is a multiple of 49 for n  2 13. (a) Let A  {1, 2, 3} and R = {(1, 1), (1, 2)}, S = {(2, 2)
For n  1 , 8 n  7n  1  8  7  1  0 ; (2, 3)} be transitive relations on A.
For n  2, 8 n  7n  1  64  14  1  49 Then R  S = {(1, 1); (1, 2); (2, 2); (2, 3)}
Obviously, R  S is not transitive. Since (1, 2)  R  S
 8 n  7n  1 is a multiple of 49 for all n  N . and (2, 3)  R  S but (1, 3)  R  S .
 X contains elements which are multiples of 49 and
14. (a) We first find R 1, we have
clearly Y contains all multiplies of 49.  X  Y .
2. (b) N 3  N 4  {3, 6, 9, 12,15......}  {4, 8,12, 16, 20,.....} R 1  {(5, 4); (4, 1); (6, 4); (6, 7); (7, 3)} . We now obtain

= {12, 24, 36......} = N12 . the elements of R 1 oR we first pick the element of R
Trick : N 3  N 4  N 12 and then of R 1 . Since (4, 5)  R and (5, 4)  R 1 , we
[  3, 4 are relatively prime numbers]. have (4, 4)  R 1oR
3. (b) n(A  B) = n(A) + n(B) – n(A  B) = 3  6  n( A  B) Similarly, (1, 4)  R, (4, 1)  R 1  (1, 1)  R 1oR
Since, maximum number of elements in A  B  3 (4, 6)  R, (6, 4)  R 1  (4, 4)  R 1oR,
 Minimum number of elements in A  B  9  3  6 .
(4, 6)  R, (6, 7)  R 1  (4, 7)  R 1oR
4. (d) A = Set of all values (x, y) : x 2  y 2  25  5 2
(7, 6)  R, (6, 4)  R 1  (7, 4)  R 1oR,
x2 y2
2
 2
1 (7, 6)  R, (6, 7)  R 1  (7, 7)  R 1oR
(12) (4)
(3, 7)  R, (7, 3)  R 1  (3, 3)  R 1oR,
Hence, R 1oR  {(1, 1); (4, 4); (4, 7); (7, 4), (7, 7); (3, 3)}.
x2 + y2 = 52
15. (d) On the set N of natural numbers,
R  {(x, y) : x, y  N ,2 x  y  41} .
2
x2 y2 x y2 Since (1,1)  R as 2.1  1  3  41 . So, R is not reflexive.
B=   1 i.e., 2
+  1.
144 16 (12) (4)2 (1, 39)  R but (39, 1)  R . So R is not symmetric (20, 1)
Clearly, A  B consists of four points. (1, 39  R . But (20,39)  R , So R is not transitive.

17