08/A, Anant Panse House, Manik Nagar, B/H Bank of Baroda, Gangapur Rd,

Nashik 422 013. Contact : +91 7020661266

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

Milestone Academy – Nashik +91 7020661266

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

Milestone Academy – Nashik +91 7020661266

 (8) n(A  B) = n(A  B) = n(U) – n(A  B) (8) If A, B and C are any three sets, then
(9) n(A  B) = n(A  B) = n(U) – n(A  B) (i) A  (B – C) = (A  B) – (A  C)
(ii)A  (B  C) = (A  B)  (A  C)
Laws of algebra of sets
Cartesian product of sets
(1) Idempotent laws : For any set A, we have
(i) A  A = A (ii) A  A = A Cartesian product of sets : Let A and B
(2) Identity laws : For any set A, we have be any two non-empty sets. The set of all
(i) A   = A (ii) A  U = A ordered pairs (a, b) such that a  A and b 
i.e.,  and U are identity elements for union B is called the cartesian product of the sets
and intersection respectively. A and B and is denoted by A  B.
(3) Commutative laws : For any two sets A and Thus, A × B = [(a, b) : a  A and b  B]
B, we have If A =  or B = , then we define A × B = .
(i) A  B = B  A (ii) A  B = B  A Example : Let A = {a, b, c} and B = {p, q}.
(iii) AB  BA Then A × B = {(a, p), (a, q), (b, p), (b, q),
i.e., union, intersection and symmetric (c, p), (c, q)}
difference of two sets are commutative. Also B × A = {(p, a), (p, b), (p, c), (q, a),
(iv) A  B  B  A (v) A  B  B  A (q, b), (q, c)}
i.e., difference and cartesian product of two sets Important theorems on cartesian
are not commutative product of sets :
(4) Associative laws : If A, B and C are any Theorem 1 : For any three sets A, B, C
three sets, then (i) A × (B  C) =(A × B)  (A × C)
(i) (A  B)  C = A  (B  C) (ii) A  (B  C) = (A (ii) A × (B  C) =(A × B)  (A × C)
 B)  C Theorem 2 : For any three sets A, B, C
(iii) ( AB)C  A(BC) A × (B – C) = (A × B) – (A × C)
i.e., union, intersection and symmetric Theorem 3 : If A and B are any two non-
difference of two sets are associative. empty sets, then
(iv) ( A  B)  C  A  (B  C) A×B=B×AA=B
(v) ( A  B)  C  A  (B  C) Theorem 4 : If A  B, then A × A  (A × B)
i.e., difference and cartesian product of two sets  (B × A)
are not associative. Theorem 5 : If A  B, then A × C  B × C for
(5) Distributive law : If A, B and C are any any set C.
three sets, then Theorem 6 : If A  B and C  D, then A × C
(i) A  (B  C) = (A  B)  (A  C) B×D
(ii) A  (B  C) = (A  B)  (A  C) Theorem 7 : For any sets A, B, C, D
i.e., union and intersection are distributive over (A × B)  (C  D) = (A  C) × (B  D)
intersection and union respectively. Theorem 8 : For any three sets A, B, C
(iii) A  (B  C)  ( A  B)  (A  C) (i) A × (B  C) = (A × B)  (A × C)
(iv) A  (B  C)  (A  B)  ( A  C) (ii) A × (B  C) = (A × B)  (A × C)
(v) A  (B  C)  ( A  B)  ( A  C)
(6) De-Morgan’s law : If A, B and C are any Relations
three sets, then Definition
(i)(A  B) = A  B
Let A and B be two non-empty sets, then
(ii) (A  B) = A  B
every subset of A × B defines a relation
(iii) A – (B  C) = (A – B)  (A – C)
from A to B and every relation from A to B is
(iv)A – (B  C) = (A – B)  (A – C) a subset of A × B.
(7) If A and B are any two sets, then
Let R  A  B and (a, b)  R. Then we say
(i) A – B = A  B (ii) B – A = B  A
that a is related to b by the relation R and
(iii)A – B = A  A  B = 
write it as a R b . If (a, b)  R , we write it as
(iv) (A – B)  B = A  B
aRb.
(v) (A – B)  B = 
(vi) A  B  B  A
(vii)(A – B)  (B – A) = (A  B) – (A  B)

Milestone Academy – Nashik +91 7020661266

 The identity and the universal relations
(1) Total number of relations : Let A and B on a non-void set are symmetric relations.
be two non-empty finite sets consisting of m A reflexive relation on a set A is not
and n elements respectively. Then A × B necessarily symmetric.
consists of mn ordered pairs. So, total number (3) Anti-symmetric relation : Let A be any
of subset of A × B is 2mn. Since each subset of A × set. A relation R on set A is said to be an
B defines relation from A to B, so total number anti-symmetric relation iff (a, b)  R and (b,
of relations from A to B is 2mn. Among these 2mn a)  R  a = b for all a, b  A.
relations the void relation  and the universal Thus, if a  b then a may be related to b
relation A × B are trivial relations from A to B. or b may be related to a, but never both.
(2) Domain and range of a relation : Let R be (4) Transitive relation : Let A be any set. A
a relation from a set A to a set B. Then the set of relation R on set A is said to be a transitive
all first components or coordinates of the relation iff
ordered pairs belonging to R is called the (a, b)  R and (b, c)  R  (a, c)  R for
domain of R, while the set of all second all a, b, c  A i.e., aRb and bRc  aRc for all
components or coordinates of the ordered pairs a, b, c  A.
in R is called the range of R. Transitivity fails only when there exists
Thus, Dom (R) = {a : (a, b)  R} and Range (R) = a, b, c such that a R b, b R c but a R c .
{b : (a, b)  R}. Example : Consider the set A = {1, 2, 3} and
the relations
Inverse relation R1  {(1, 2), (1, 3)} ; R 2 = {(1, 2)}; R 3 = {(1, 1)};
R 4 = {(1, 2), (2, 1), (1, 1)}
Let A, B be two sets and let R be a relation
from a set A to a set B. Then the inverse of R, Then R 1 , R 2 , R 3 are transitive while R 4 is
denoted by R–1, is a relation from B to A and is not transitive since in R4 , (2, 1)  R4 ; (1, 2)  R4
defined by R 1  {(b, a) : (a, b)  R} but (2, 2)  R4 .
Clearly (a, b)  R  (b, a)  R–1. The identity and the universal relations
Also, Dom (R) = Range (R 1 ) and Range (R) = on a non-void sets are transitive.
Dom (R 1 ) (5) Identity relation : Let A be a set. Then
Example : Let A = {a, b, c}, B = {1, 2, 3} and R = the relation IA = {(a, a) : a  A} on A is called
{(a, 1), (a, 3), (b, 3), (c, 3)}. the identity relation on A.
Then, (i) R–1 = {(1, a), (3, a), (3, b), (3, c)} In other words, a relation IA on A is
(ii) Dom (R) = {a, b, c} = Range (R 1 ) called the identity relation if every element
(iii) Range (R) = {1, 3} = Dom (R 1 ) of A is related to itself only. Every identity
relation will be reflexive, symmetric and
Types of relations
transitive.
Example : On the set = {1, 2, 3}, R = {(1, 1),
(1) Reflexive relation : A relation R on
(2, 2), (3, 3)} is the identity relation on A .
a set A is said to be reflexive if every element of
It is interesting to note that every
A is related to itself.
identity relation is reflexive but every
Thus, R is reflexive  (a, a)  R for all a  A.
reflexive relation need not be an identity
Example : Let A = {1, 2, 3} and R = {(1, 1); (1, 3)}
relation.
Then R is not reflexive since 3  A but (3, 3)  R (6) Equivalence relation : A relation R on a
A reflexive relation on A is not necessarily the set A is said to be an equivalence relation on
identity relation on A. A iff
The universal relation on a non-void set A is
(i) It is reflexive i.e. (a, a)  R for all a  A
reflexive.
(ii) It is symmetric i.e. (a, b)  R  (b, a) 
(2) Symmetric relation : A relation R on a set A
R, for all a, b  A
is said to be a symmetric relation iff (a, b)  R
(iii) It is transitive i.e. (a, b)  R and (b, c) 
 (b, a)  R for all a, b  A
R  (a, c)  R for all a, b, c  A.
i.e., aRb  bRa for all a, b  A.
Congruence modulo (m) : Let m be an
it should be noted that R is symmetric iff
arbitrary but fixed integer. Two integers a
R 1  R
and b are said to be congruence modulo m

Milestone Academy – Nashik +91 7020661266

if a  b is divisible by m and we write a  b
(mod m).
Thus a  b (mod m)  a  b is divisible by m.
For example, 18  3 (mod 5) because 18 – 3 =
15 which is divisible by 5. Similarly, 3  13 (mod
2) because 3 – 13 = –10 which is divisible by 2.
But 25  2 (mod 4) because 4 is not a divisor of
25 – 3 = 22.
The relation “Congruence modulo m” is an
equivalence relation.

Equivalence classes of an equivalence

relation

Let R be equivalence relation in A(  ) .

Let a  A . Then the equivalence class of a,
denoted by [a] or {a } is defined as the set of all
those points of A which are related to a under
the relation R. Thus [a] = {x  A : x R a}.
It is easy to see that
(1) b [a]  a [b]
(2) b [a]  [a]  [b]
(3) Two equivalence classes are either disjoint
or identical.
Composition of relations

Let R and S be two relations from sets A

to B and B to C respectively. Then we can define
a relation SoR from A to C such that (a, c)  SoR
  b  B such that (a, b)  R and (b, c)  S.
This relation is called the composition of R and
S.
For example, if A = {1, 2, 3}, B = {a, b, c, d}, C={p,
q, r, s} be three sets such that R = {(1, a), (2, b),
(1, c), (2, d)} is 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) (2, r) (1, r)}
In this case RoS does not exist.
In general RoS  SoR. Also (SoR)–1 = R–1oS–1.

Milestone Academy – Nashik +91 7020661266

 10. In a class of 55 students, the numb
1. The set of intelligent students in a class is of students studying different subjects are
(a) A null set 23 in Mathematics, 24 in Physics, 19 in
(b) A singleton set Chemistry, 12 in Mathematics and Physics,
(c) A finite set 9 in Mathematics and Chemistry, 7 in
(d) Not a well defined collection Physics and Chemistry and 4 in all the
three subjects. The number of students
2. If a set A has n elements, then the total who have taken exactly one subject is
number of subsets of A is (a) 6 (b) 9
(a) n (b) n 2 (c) 7 (d) All of these
(c) 2 n
(d) 2n
11. If A, B and C are non-empty sets, then
3. The number of proper subsets of the set (A – B)  (B – A) equals
{1, 2, 3} is (a) (A  B) – B
(a) 8 (b) 7 (b) A – (A  B)
(c) 6 (d) 5 (c) (A  B) – (A  B)
(d) (A  B)  (A  B)
4. Given the sets A  {1, 2, 3}, B  {3,4} ,
C = {4, 5, 6}, then A  (B  C) is 12. Which set is the subset of all given sets
(a) {3} (b) {1, 2, 3, 4} (a) {1, 2, 3, 4,......} (b) {1}
(c) {1, 2, 4, 5} (d){1, 2, 3, 4, 5, 6} (c) {0} (d) {}

5. If A and B are any two sets, then 13. Let S  {0,1, 5, 4, 7} . Then the total number of
A  ( A  B) is equal to subsets of S is
(a) A (b) B (a) 64 (b) 32
(c) A c (d) B c (c) 40 (d) 20

6. If A and B are two given sets, then 14. The number of non-empty subsets of the set
A  ( A  B)c is equal to {1, 2, 3, 4} is
(a) A (b) B (a) 15 (b) 14
(c)  (d) A  B c (c) 16 (d) 17

7. Let A  [x : x  R,| x |  1]; 15. If A = {2, 3, 4, 8, 10}, B = {3, 4, 5, 10, 12},

C = {4, 5, 6, 12, 14} then (A  B)  (A  C)
B  [x : x  R,| x  1 |  1] and A  B  R  D,
is equal to
then the set D is (a) {3, 4, 10} (b) {2, 8, 10}
(a) [x : 1  x  2] (b) [x : 1  x  2] (c) {4, 5, 6} (d) {3, 5, 14}
(c) [x : 1  x  2] (d) None of these
16. If A, B, C be three sets such that A  B = A 
8. Let n(U)  700, n( A)  200, n(B)  300 and C and A  B = A  C, then
n( A  B)  100, then n( A c  B c )  (a) A = B (b) B = C
(a) 400 (b) 600 (c) A = C (d) A = B = C
(c) 300 (d) 200
17. Let U  {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} ,
9. In a town of 10,000 families it was found A  {1, 2, 5}, B  {6, 7} , then A  B is
that 40% family buy newspaper A, 20% (a) B  (b) A
buy newspaper B and 10% families buy (c) A  (d) B
newspaper C, 5% families buy A and B, 3%
buy B and C and 4% buy A and C. If 2% 18. If A is any set, then
families buy all the three newspapers, (a) A  A   (b) A  A  U
then number of families which buy A only (c) A  A  U (d) None of these
is
(a) 3100 (b) 3300
(c) 2900 (d) 1400
Milestone Academy – Nashik +91 7020661266
 27. Of the members of three athletic teams in
19. If A and B are two sets then (A – B)  a school 21 are in the cricket team, 26 are
(B – A)  (A  B) is equal to in the hockey team and 29 are in the
(a) A  B (b) A  B football team. Among them, 14 play
(c) A (d) B hockey and cricket, 15 play hockey and
football, and 12 play football and cricket.
20. Let A and B be two sets then Eight play all the three games. The total
( A  B)  ( A  B) is equal to number of members in the three athletic
(a) A (b) A teams is
(c) B (d) None of these (a) 43 (b) 76
(c) 49 (d) None of these
21. Let U be the universal set and
A  B  C  U . Then 28. In a class of 100 students, 55 students have
{( A  B)  (B  C)  (C  A)} is equal to passed in Mathematics and 67 students
(a) A  B  C (b) A  (B  C) have passed in Physics. Then the number
of students who have passed in Physics
(c) A  B  C (d) A  (B  C)
only is
(a) 22 (b) 33
22. 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 equal to 29. A set contains 2n  1 elements. The number
(a) 0.3 (b) 0.5 of subsets of this set containing more than
(c) 0.05 (d) None of these n elements is equal to
(a) 2n 1 (b) 2 n
23. In a battle 70% of the combatants lost one (c) 2 n 1
(d) 2 2n
eye, 80% an ear, 75% an arm, 85% a leg,
x% lost all the four limbs. The minimum 30. Which of the following is a true statement
value of x is (a) {a}  {a, b, c} (b) {a}  {a, b, c}
(a) 10 (b) 12 (c)   {a, b, c} (d) None of these
(c) 15 (d) None of these
Relations
24. Out of 800 boys in a school, 224 played
cricket, 240 played hockey and 336 played 31. Let A = {1, 2, 3}. The total number of
basketball. Of the total, 64 played both distinct relations that can be defined over
basketball and hockey; 80 played cricket A is
and basketball and 40 played cricket and (a) 2 9 (b) 6
hockey; 24 played all the three games. The (c) 8 (d) None of these
number of boys who did not play any game
is 32. Let X  {1, 2, 3, 4, 5} and Y  {1, 3, 5, 7, 9} .
(a)128 (b) 216
Which of the following is/are relations
(c)240 (d) 160
from X to Y
(a) R1  {( x, y)| y  2  x, x  X , y  Y }
25. A survey shows that 63% of the Americans
like cheese whereas 76% like apples. If x% of (b) R2  {(1,1), (2,1), (3, 3), (4, 3), (5, 5)}
the Americans like both cheese and apples, (c) R3  {(1,1), (1, 3)(3, 5), (3, 7), (5, 7)}
then (d) R4  {(1, 3), (2, 5), (2, 4), (7, 9)}
(a) x  39 (b) x  63
(c) 39  x  63 (d) None of these 33. Given two finite sets A and B such that
n(A) = 2, n(B) = 3. Then total number of
26. 20 teachers of a school either teach relations from A to B is
mathematics or physics. 12 of them teach (a) 4 (b) 8
mathematics while 4 teach both the subjects. (c) 64 (d) None of these
Then the number of teachers teaching
physics only is
(a) 12 (b)8 (c)16 (d)None of these
Milestone Academy – Nashik +91 7020661266
 43. Let A = {1, 2, 3, 4} and let R= {(2, 2), (3, 3),
34. Let P  {( x, y)| x 2  y 2  1, x , y  R} . Then P is (4, 4), (1, 2)} be a relation on A. Then R is
(a) Reflexive (b)Symmetric (a) Reflexive (b) Symmetric
(c) Transiti (d) Anti-symmetric (c) Transitive (d) None of these

35. For real numbers x and y, we write 44. Let n be a fixed positive integer. Define a
xRy  x  y  2 is an irrational number. relation R on the set Z of integers by,
aRb  n | a  b |. Then R is
Then the relation R is
(a) Reflexive (b) Symmetric (a) Reflexive (b) Symmetric
(c) Transitive (d) None of these (c) Transitive (d) Equivalence

36. Let X be a family of sets and R be a relation 45.Let

R  {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3, 12), (3, 6)}
on X defined by ‘A is disjoint from B’. Then
R is be a relation on the set A  {3, 6, 9, 12} .
(a) Reflexive (b) Symmetric The relation is
(c) Anti-symmetric (d) Transitive (a) An equivalence relation
(b) Reflexive and symmetric only
37. Let A = {a, b, c} and B = {1, 2}. Consider a (c) Reflexive and transitive only
relation R defined from set A to set B. (d) Reflexive only
Then R is equal to set
(a) A (b) B
(c) A × B (d) B × A

38. Let n(A) = n. Then the number of all

relations on A is
(a) 2 n (b) 2(n)!
(c) 2 n (d) None of these
2

39. If R is a relation from a finite set A having

m elements to a finite set B having n
elements, then the number of relations
from A to B is
(a) 2 mn (b) 2 mn  1
(c) 2mn (d) m n

40. A relation R is defined from {2, 3, 4, 5} to

{3, 6, 7, 10} by xRy  x is relatively prime
to y. Then domain of R is
(a) {2, 3, 5} (b) {3, 5}
(c) {2, 3, 4} (d) {2, 3, 4, 5}

41. Let R be a relation on N defined by

x  2y  8 . The domain of R is
(a) {2, 4, 8} (b) {2, 4, 6, 8}
(c) {2, 4, 6} (d) {1, 2, 3, 4}

42. Let A be the non-void set of the children in

a family. The relation x is a brother of y 
on A is
(a) Reflexive (b) Symmetric
(c) Transitive (d) None of these

Milestone Academy – Nashik +91 7020661266

 Answers: SETS

1) d 2) c 3) c 4) b 5) a
6) d 7) b 8) c 9) b 10) d
11) c 12) d 13) b 14) a 15) a
16) b 17) b 18) b 19) a 20) a
21) c 22) c 23) a 24) d 25) c
26) a 27) a 28) d 29) d 30) a