Set Relation and Functions

Sets, Relations & Function
SETS
SET
A set is a collection of well defined objects which are distinct from each other. Sets are generally denoted by
capital letters A, B, C, ........ etc. and the elements of the set by small letters a, b, c ....... etc.
If a is an element of a set A, then we write a  A and say a belongs to A.
If a does not belong to A then we write a  A,
e.g. the collection of first five prime natural numbers is a set containing the elements 2, 3, 5, 7, 11.
METHODS TO WRITE A SET :

(i) Roster Method or Tabular Method : In this method a set is described by listing elements, separated by
commas and enclose then by curly brackets. Note that while writing the set in roster form, an element is not
generally repeated e.g. the set of letters of word SCHOOL may be written as {S, C, H, O, L}.
(ii) Set builder form (Property Method) : In this we write down a property or rule which gives us all the
element of the set.
A = {x : P(x)} where P(x) is the property by which x  A and colon ( : ) stands for ‘such that’
Example # 1 : Express set A = {x : x  N and x = 2n for n  N} in roster form
Solution : A = {2, 4, 8, 16, .........}
Example # 2 : Express set B = {x3 : x < 5, x  W} in roster form

Solution : B = {0, 1, 8, 27, 64}
Example # 3 : Express set A = {0, 7, 26, 63, 124} in set builder form
Solution : A = {x : x = n3 – 1, nN, 1  n  5}
TYPES OF SETS
Null set or empty set : A set having no element in it is called an empty set or a null set or void set, it is
denoted by  or { }. A set consisting of at least one element is called a non-empty set or a non-void set.
Singleton set : A set consisting of a single element is called a singleton set.
Finite set : A set which has only finite number of elements is called a finite set.
Order of a finite set : The number of distinct elements in a finite set A is called the order of this set and
denoted by O(A) or n(A). It is also called cardinal number of the set.
e.g. A = {a, b, c, d}  n(A) = 4
Infinite set : A set which has an infinite number of elements is called an infinite set.
Equal sets : Two sets A and B are said to be equal if every element of A is member of B, and every element
of B is a member of A. If sets A and B are equal, we write A = B and if A and B are not equal then
AB
Equivalent sets : Two finite sets A and B are equivalent if their cardinal number is same
i.e. n(A) = n(B)
e.g. A = {1, 3, 5, 7}, B = {a, b, c, d}  n(A) = 4 and n(B) = 4
 A and B are equivalent sets
Note - Equal sets are always equivalent but equivalent sets may not be equal
Corporate Office: CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 200 2244 | 1800 258 5555 | CIN: U80302RJ2007PLC024029
ADVSRF -1
Example # 4 : Identify the type of set :
(i) A = {x  W : 3  x < 10} (ii) A = {}
(iii) A = {1, 0, –1, –2, –3,.......} (iv) A = {1, 8, –2, 6, 5} and B = {1, 8, –2, 1, 6, 5}
(v) A = {x : x is number of students in a class room}
Solution : (i) finite set (ii) finite set
(iii) infinite set (iv) equal sets
(v) singleton set
Self Practice Problem :

(1) Write the set of all integers 'x' such that –2 < x – 4 < 5.
(2) Write the set {1, 2, 5, 10} in set builder form.
(3) If A = {x : x2 < 9, x  Z} and B = {–2, –1, 1, 2} then find whether sets A and B are equal or not.
Answers (1) {3, 4, 5, 6, 7, 8}
(2) {x : x is a natural number and a divisor of 10}
(3) Not equal sets
SUBSET AND SUPERSET :

Let A and B be two sets. If every element of A is an element of B then A is called a subset of B and B is called
superset of A. We write it as A  B.
e.g. A = {1, 2, 3, 4} and B = {1, 2, 3, 4, 5, 6, 7}  A  B
If A is not a subset of B then we write A / B
PROPER SUBSET :
If A is a subset of B but A  B then A is a proper subset of B and we write A  B. Set A is not proper subset of
A so this is improper subset of A
Note : (i) Every set is a subset of itself
(ii) Empty set  is a subset of every set
(iii) A  B and B  A  A = B
(iv) The total number of subsets of a finite set containing n elements is 2n.
(v) Number of proper subsets of a set having n elements is 2n – 1.
(vi) Empty set  is proper subset of every set except itself.
POWER SET :
Let A be any set. The set of all subsets of A is called power set of A and is denoted by P(A)
Example # 5 : Examine whether the following statements are true or false :
(i) {a} / {b, c, a}
(ii) {x, p} / {x : x is a consonant in the English alphabet}
(iii) {}  {}
(iv) {a, b} {a, {a}, b, c}
Solution : (i) False as {a} is subset of {b, c, a}
(ii) False as x, p are consonant
(iii) False as element ,  is not in the set {}
(iv) False as a, b {a, {a}, b, c} and {a, b}  {a, {a}, b, c}
ADVSRF -2
Example # 6 : Find power set of set A = {1, 2, 3}
Solution : P(A) = {, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}}
Example # 7 : If  denotes null set then find

(a) P()
(b) P(P())
(c) n(P(P(P())))
(d) n(P(P(P(P()))))
Solution : (a) P() = {}
(b) P(P()) = {,{}}
(c) n(P(P(P()))) = 22 = 4
(d) n(P(P(P(P())))) = 24 = 16

(4) State true/false :A = {p, q, r, s}, B = {p, q, r, p, t} then A  B.
(5) State true/false :A = {p, q, r, s}, B = {s, r, q, p} then A  B.
(6) State true/false :[4, 15)  [–15, 15]
Answers (4) False (5) False (6) True
UNIVERSAL SET :
A set consisting of all possible elements which occur in the discussion is called a universal set and is
denoted by U.
e.g. if A = {1, 2, 3}, B = {2, 4, 5, 6}, C = {1, 3, 5, 7} then U = {1, 2, 3, 4, 5, 6, 7} can be taken as the universal
set.
SOME OPERATION ON SETS :

(i) Union of two sets : A  B = {x : x  A or x  B}
e.g. A = {1, 2, 3}, B = {2, 3, 4} then A  B = {1, 2, 3, 4}
(ii) Intersection of two sets : A  B = {x : x  A and x  B}

e.g. A = {1, 2, 3}, B = {2, 3, 4} then A  B = {2, 3}
(iii) Difference of two sets : A – B = {x : x  A and x  B}. It is also written as AB'.

Similarly B – A = B  A' e.g. A = {1, 2, 3}, B = {2, 3, 4} ; A – B = {1}
(iv) Symmetric difference of sets : It is denoted by A  B and A  B = (A – B)  (B – A)
(v) Complement of a set : A' = {x : x  A but x  U} = U – A

e.g. U = {1, 2,........, 10}, A = {1, 2, 3, 4, 5} then A' = {6, 7, 8, 9, 10}
(vi) Disjoint sets : If A  B = , then A, B are disjoint sets.
e.g. If A = {1, 2, 3}, B = {7, 8, 9} then A  B = 
VENN DIAGRAM :
Most of the relationships between sets can be represented by means of diagrams which are known as venn
diagrams.These diagrams consist of a rectangle for universal set and circles in the rectangle for subsets of
universal set. The elements of the sets are written in respective circles.
For example If A = {1, 2, 3}, B = {3, 4, 5}, U = {1, 2, 3, 4, 5, 6, 7, 8} then their venn diagram is
ADVSRF -3
AB AB A–B B–A
A' (A B) = (A – B) (B – A) Disjoint

LAWS OF ALGEBRA OF SETS (PROPERTIES OF SETS):
(i) Commutative law : (A  B) = B  A ; A  B = B  A
(ii) Associative law : (A  B)  C = A  (B  C) ; (A  B)  C = A  (B  C)
(iii) Distributive law : A (B  C) = (A  B)  (A  C) ; A  (B  C) = (A  B)  (A  C)
(iv) De-morgan law : (A  B)' = A'  B' ; (A  B)' = A'  B'
(v) Identity law : A  U = A ; A   = A
(vi) Complement law : A  A' = U, A  A' = , (A')' = A
(vii) Idempotent law : A  A = A, A  A = A
NOTE :
(i) A – (B  C) = (A – B)  (A – C) ; A – (B  C) = (A – B)  (A – C)
(ii) A   = , A  U = U
Example # 8 : Let A = {1, 2, 3, 4, 5, 6} and B = {4, 5, 6, 7, 8, 9} then find A  B

Solution : A  B = {1, 2, 3, 4, 5, 6, 7, 8, 9}
Example # 9 : Let A = {1, 2, 3, 4, 5, 6}, B = {4, 5, 6, 7, 8, 9}. Find A – B and B – A.

Solution : A – B = {x : x  A and x  B} = {1, 2, 3}
similarly B – A = {7, 8, 9}
Example # 10 : State true or false :

(i) A  A = A (ii) U A = A
Solution : (i) false because A  A' = U
(ii) true as U A = A
Example # 11 : Use Venn diagram to prove that A – B = A  B.
Solution :
From venn diagram we can conclude that A – B = A  B.

(7) Find A  B if A = {x : x = 2n + 1, n  5, n  N} and B = {x : x = 3n – 2, n  4, n  N}.
(8) Find A – (A – B) if A = {5, 9, 13, 17, 21} and B = {3, 6, 9, 12, 15, 18, 21, 24}
Answers (7) {1, 3, 4, 5, 7, 9, 10, 11} (8) {9, 21}
ADVSRF -4
SOME IMPORTANT RESULTS ON NUMBER OF ELEMENTS IN SETS :
If A, B, C are finite sets and U be the finite universal set then
(i) n(A  B) = n(A) + n(B) – n(A  B)
(ii) n(A – B) = n(A) – n(A  B)
(iii) n(A  B  C) = n(A) + n(B) + n(C) – n(A  B) – n(B  C) – n(A  C) + n(A  B  C)
(iv) Number of elements in exactly two of the sets A, B, C

= n(A  B) + n(B  C) + n(C  A) – 3n(A  B  C)
(v) Number of elements in exactly one of the sets A, B, C

= n(A) + n(B) + n(C) – 2n(A  B) – 2n(B  C) – 2n(A  C) + 3n(A  B  C)
Example # 12: In a group of 60 students, 36 read english newspaper, 22 read Hindi newspaper and 12 read neither
of the two. How many read both English & Hindi news papers ?
Solution : n(U) = 60, n(E) = 36, n(H) = 22
n(E  H) = 12  n(E  H) = 12
 n(U) – n(E  H) = 12
 n(E  H) = 48
 n(E) + n(H) – n(E  H) = 48
 n(E  H) = 58 – 48 = 10
Example#13 : In a group of 50 persons, 14 drink tea but not coffee and 30 drink tea. Find
(i) How many drink tea and coffee both ? (ii) How many drink coffee but not tea ?
Solution : T : people drinking tea
C : people drinking coffee
(i) n(T) = n(T – C) + n(T  C)  30 = 14 + n(T  C)  n(T  C) = 16
(ii) n(C – T) = n(T  C) – n(T) = 50 – 30 = 20

(9) Let A and B be two finite sets such that n(A – B) = 15, n(A  B) = 90, n(A  B) = 30. Find n(B)
(10) A market research group conducted a survey of 1000 consumers and reported that 720 consumers
liked product A and 450 consumers liked product B. What is the least number that must have liked
both products ?
Answers (9) 75 (10) 170
RELATIONS
ORDERED PAIR :
A pair of objects listed in a specific order is called an ordered pair. It is written by listing the two objects in
specific order separating them by a comma and then enclosing the pair in parantheses.
In the ordered pair (a, b), a is called the first element and b is called the second element.
Two ordered pairs are set to be equal if their corresponding elements are equal. i.e.
(a, b) = (c, d) if a = c and b = d.
ADVSRF -5
CARTESIAN PRODUCT :
The set of all possible ordered pairs (a, b), where a  A and b  B i.e. {(a, b) ; a  A and b  B} is called the
cartesian product of A to B and is denoted by A × B. Usually A × B  B × A.
Similarly A × B × C = {(a, b, c) : a  A, b  B, c  C} is called ordered triplet.
RELATION:
Let A and B be two sets. Then a relation R from A to B is a subset of A × B. Thus, R is a relation from A to B
 R  A × B. The subsets is derived by describing a relationship between the first element and the second
element of ordered pairs in A × B e.g. if A = {1, 2, 3, 4, 5, 6, 7, 8} and B = {1, 2, 3, 4, 5} and
R = {(a, b) : a = b2, a  A, b  B} then R = {(1, 1), (4, 2), (9, 3)}. Here a R b  1 R 1, 4 R 2, 9 R 3.
NOTE :
(i) Let A and B be two non-empty finite sets consisting of m and n elements respectively. Then A × B
consists of mn ordered pairs. So total number of subsets of A × B i.e. number of relations from A to
B is 2mn.
(ii) A relation R from A to A is called a relation on A.
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 of coordinates of the ordered
pairs belonging to R is called to domain of R, while the set of all second components of corrdinates of the
ordered pairs in R is called the range of R.
Thus, Dom (R) = {a : (a, b)  R} and Range (R) = {b : (a, b)  R}
It is evident from the definition that the domain of a relation from A to B is a subset of A and its range is a
subset of B.
Example#14 : If A = {1, 2} and B = {3, 4}, then find A × B.

Solution : A × B = {(1, 3), (1, 4), (2, 3), (2, 4)}
Example#15 : Let A = {1, 3, 5, 7} and B = {2, 4, 6, 8} be two sets and let R be a relation from A to B defined by the
phrase "(x, y)  R  x > y". Find relation R and its domain and range.
Solution : Under relation R, we have 3R2, 5R2, 5R4, 7R2, 7R4 and 7R6
i.e. R = {(3, 2), (5, 2), (5, 4), (7, 2), (7, 4), (7, 6)}
 Dom (R) = {3, 5, 7} and range (R) = {2, 4, 6}
Example#16 : Let A = {2, 3, 4, 5, 6, 7, 8, 9}. Let R be the relation on A defined by

{(x, y) : x  A, y  A & x2 = y or x = y2}.
Find domain and range of R.
Solution: The relation R is
R = {(2, 4), (3, 9), (4, 2), (9, 3)}
Domain of R = {2, 3, 4, 9}
Range of R = {2, 3, 4, 9}
(11) If (2x + y, 7) = (5, y – 3) then find x and y.
(12) If A × B = {(1, 2), (1, 3), (1, 6), (7, 2), (7, 3), (7, 6)} then find sets A and B.
(13) If A = {x, y, z} and B = {1, 2} then find number of relations from A to B.
(14) Write R = {(4x + 3, 1 – x) : x  2, x  N}

5
Answers (11) x=– , y = 10 (12) A = {1, 7}, B = {2, 3, 6}
2
(13) 64 (14) {(7, 0), (11, –1)}
ADVSRF -6
TYPES OF RELATIONS :
In this section we intend to define various types of relations on a given set A.
(i) Void relation : Let A be a set. Then   A × A and so it is a relation on A. This relation is called
the void or empty relation on A.
(ii) Universal relation : Let A be a set. Then A × A  A × A and so it is a relation on A. This relation
is called the universal relation on A.
(iii) Identity relation : Let A be a set. Then the relation IA = {(a, a) : a  A} on A is called the identity
relation on A. In other words, a relation IA on A is called the identity relation if every element of A
is related to itself only.
(iv) Reflexive relation : A relation R on a set A is said to be reflexive if every element of A is related
to itself. Thus, R on a set A is not reflexive if there exists an element a  A such that (a, a)  R.
Note : Every identity relation is reflexive but every reflexive relation in not identity.
(v) Symmetric relation : A relation R on a set A is said to be a symmetric relation
iff (a, b)  R  (b ,a)  R for all a, b  A. i.e. a R b  b R a for all a, b  A.
(vi) Transitive relation : Let A be any set. A relation R on A is said to be a transitive relation
iff (a, b)  R and (b, c)  R  (a, c)  R for all a, b, c  A i.e. a R b and b R c  a R c
for all a, b, c  A
(vii) Equivalence relation : A relation R on a set A is said to be an equivalence relation on A iff

(i) it is reflexive i.e. (a, a)  R for all a  A
(ii) it is symmetric i.e. (a, b)  R  (b, a)  R for all a, b  A
(iii) it is transitive i.e. (a, b)  R and (b, c)  R  (a, c)  R for all a, b  A
Example#17 : Which of the following are identity relations on set A = {1, 2, 3}.
R1 = {(1, 1), (2, 2)}, R2 = {(1, 1), (2, 2), (3, 3), (1, 3)}, R3 = {(1, 1), (2, 2), (3, 3)}.
Solution: The relation R3 is idenity relation on set A.
R1 is not identity relation on set A as (3, 3)  R1.
R2 is not identity relation on set A as (1, 3)  R2
Example#18 : Which of the following are reflexive relations on set A = {1, 2, 3}.
R1 = {(1, 1), (2, 2), (3, 3), (1, 3), (2, 1)}, R2 = {(1, 1), (3, 3), (2, 1), (3, 2)}..
Solution : R1 is a reflexive relation on set A.
R2 is not a reflexive relation on A because 2  A but (2, 2)  R2.
Example#19 : Prove that on the set N of natural numbers, the relation R defined by x R y  x is less than y is
transitive.
Solution : Because for any x, y, z  N x < y and y < z  x < z  x R y and y R z  x R z. so R is
transitive.
Example#20 : Let T be the set of all triangles in a plane with R a relation in T given by R = {(T1 , T2) : T1 is
congruent to T2}. Show that R is an equivalence relation.
Solution : Since a relation R in T is said to be an equivalence relation if R is reflexive, symmetric and
transitive.
(i) Since every triangle is congruent to itself
 R is reflexive
(ii) (T1 , T2)  R  T1 is congruent to T2  T2 is congruent to T1  (T2, T1)  R
Hence R is symmetric
(iii) Let (T1, T2)  R and (T2, T3)  R  T1 is congruent to T2 and T2 is congruent to T3
 T1 is congruent to T3  (T1, T3)  R
 R is transitive
Hence R is an equivalence relation.
Example#21 : Show that the relation R in R defined as R = {(a, b) : a  b} is transitive.

Solution : Let (a, b)  R and (b, c)  R
 (a  b) and b  c  a  c  (a, c)  R Hence R is transitive.
ADVSRF -7
Example#22 : Show that the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is symmetric.
Solution : Let (a, b)  R [ (1, 2)  R]
 (b, a)  R [ (2, 1)  R]
Hence R is symmetric.

(15) Let L be the set of all lines in a plane and let R be a relation defined on L by the rule (x ,y)  R
 x is perpendicular to y. Then prove that R is a symmetric relation on L.
(16) Let R be a relation on the set of all lines in a plane defined by (1, 2)  R  line 1 is parallel to
line 2. Prove that R is an equivalence relation.
FUNCTION
Definition :
Function is a rule (or correspondence), from a non empty set A to a non empty set B, that associates
each member of A to a unique member of B. Symbolically, we write f: A  B. We read it as "f is a
function from A to B".
For example, let A  {–1, 0, 1} and B  {0, 1, 2}.
Then A × B  {(–1, 0), (–1, 1), (–1, 2), (0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2)}
Now, " f : A  B defined by f(x) = x 2 " is the function such that
f  {(–1, 1), (0, 0), (1, 1)}
f can also be shown diagramatically by following mapping.
A B
Note : Every function say y = f(x) : A  B. Here x is independent variable which takes its values from A while
'y' takes its value from B. A relation will be a function if and only if
(i) x must be able to take each and every value of A and
and (ii) one value of x must be related to one and only one value of y in set B.
Graphically : If any vertical line cuts the graph at more than one point, then the graph does not
represent a function.
Example#23 : (i) Which of the following correspondences can be called a function ?

(A) f(x) = x 3 ; {–1, 0, 1}  {0, 1, 2, 3}
(B) f(x) = ± x ; {0, 1, 4}  {–2, –1, 0, 1, 2}
(C) f(x) = x ; {0, 1, 4}  {–2, –1, 0, 1, 2}
(D) f(x) = – x ; {0, 1, 4}  {–2, –1, 0, 1, 2}
(ii) Which of the following pictorial diagrams represent the function
(A) (B)
(C) (D)
ADVSRF -8
Solution :
(i) f(x) in (C) and (D) are functions as definition of function is satisfied. while in case of (A) the
given relation is not a function, as f(–1)  2nd set. Hence definition of function is not satisfied.
While in case of (B), the given relation is not a function, as f(1) = ± 1 and f(4) = ± 2 i.e. element
1 as well as 4 in 1st set is related with two elements of 2nd set.Hence definition of function is not
satisfied.
(ii) B and D. In (A) one element of domain has no image, while in (C) one element of 1st set has
two images in 2nd set
Self practice problem :
(17) Let g(x) be a function defined on [1, 1]. If the area of the equilateral triangle with two of its
vertices at (0,0) and (x,g(x)) is 3 / 4 sq. unit, then the function g(x) may be.
2
(A) g(x)=  (1  x ) (B) g(x) = (1  x 2 ) (C) g(x) =  (1  x 2 ) (D) g(x) = (1  x 2 )
(18) Represent all possible functions defined from {} to {1, 2}.
Answers : (17) A, B, C
(18) (i) (ii)
(iii) (iv)
Domain, Co-domain and Range of a Function :
Let y = f(x) : A  B, then the set A is known as the domain of f and the set B is known as co-domain
of f.
If x 1 is mapped to y1, then y1 is called as image of x 1 under f. Further x 1 is a pre-image of y1 under f.

If only expression of f (x) is given (domain and co-domain are not mentioned), then domain is complete
set of those values of x for which f (x) is real, while codomain is considered to be (– , )
(except in inverse trigonometric functions).
Range is the complete set of values that y takes. Clearly range is a subset of Co-domain.
A function whose domain and range are both subsets of real numbers is called a real function.
Example#24 : Find the domain of following functions :

(i) f(x) = x2  5 (ii) sin–1 (2x – 1)
Solution : (i) f(x) = 2
x 2  5 is real iff x – 5  0
 |x|  5  x  – 5 or x  5
 the domain of f is (–, – 5 ]  [ 5 , )

(ii) sin–1 (2x – 1) is real iff –1  2x – 1  + 1
 domain is x  [0, 1]
ADVSRF -9
leqPp;] lEcU/k ,oa Qyu
leqPp; (SETS)
leqPp; (SET ) :
,d nwljs ls fHkUu&fHkUu oLrqvkas ds lqifjHkkf"kr (well defined) laxzg dks leqPPk; dgrs gS A
leqPPk; dks izk;% vaxzsth o.kZekyk ds cMs+ v{kjksa A, B, C, ........ vkfn ls fu:fir djrs gS rFkk leqPp; ds vo;oksa dks vaxszth
o.kZekyk ds NksVs v{kj a, b, c ....... vkfn }kjk iznf'kZr djrs gSA
;fn a, leqPp; A dk vo;o gS] rc bls a  A ls O;Dr fd;k tkrk gS rFkk ge dgrs gS fd ‘a leqPp; A esa gS’ A ;fn a,
leqPp; A dk vo;o ugha gS] rc bls a  A ls O;Dr fd;k tkrk gS rFkk bls ‘a leqPp; A esa ugha gS’ i<+rs gSA
mnkgj.k % izFke ik¡p vHkkT; izkd`Ùk la[;kvksa dk laxzg ,d leqPp; gksxkA ftlds vo;o 2, 3, 5, 7, 11 gksxsaA
leqPp; dks fu:fir djus dh fof/k;k¡ (METHODS TO WRITE A SET) :
(i) jksLVj :Ik ;k lkj.khc) :i (Roster or Tabular form) : bl fof/k esa] leqPp; ds lHkh vo;oksa dks lwpho) fd;k
tkrk gS] vo;oksa dks ,d nwljs ls] v/kZfojke (commas) }kjk i`Fkd fd;k tkrk gS rFkk mu lHkh dks ,d e>ys ¼/kuq½ dks"Bd
{ } ds Hkhrj fy[krs gSA ;g /;ku j[kuk pkfg, fd leqPp; dks jksLVj :i esa fy[krs le; fdlh Hkh vo;o dh lkekU;r%
iqujko`fÙk ugha djrs gSA
mnkgj.k % 'kCn ‘SCHOOL’ ds v{kjksa dk leqPp; {S, C, H, O, L} fy[kk tk ldrk gSA
(ii) leqPPk; fuekZ.k :i ;k xq.k/keZ :i (Set builder form or property form) : bl fof/k esa] fdlh leqPp; ds
lHkh vo;oksa dk o.kZu djus ds fy, ge ,d loZfu"B xq.k/keZ ;k fu;e fy[krs gSA
A = {x : P(x)} tgk¡ P(x) ,d xq.k/keZ gS ftlds fy, x  A rFkk dksyu ( : ) dk fpUg dk eryc ^bl izdkj gS fd* gSA
mnkgj.k # 1 : leqPp; A = {x : x  N rFkk x = 2n tgk¡ n  N} dks jksLVj :i esa fyf[k;sA

gy : A = {2, 4, 8, 16, .........}
mnkgj.k # 2 : leqPp; B = {x3 : x < 5, x  W} dks jksLVj :i esa fyf[k;s

gy : B = {0, 1, 8, 27, 64}
mnkgj.k # 3 : leqPp; A = {0, 7, 26, 63, 124} dks leqPp; fuekZ.k :i esa fyf[k;sA
gy : A = {x : x = n3 – 1, nN, 1  n  5}
leqPp;ksa ds izdkj (TYPES OF SETS)

fjDr leqPPk; (Null set or empty set) : ,d leqPp; ftlesa ,d Hkh vo;o fo|eku ugha gks] fjDr leqPp; ;k 'kwU;
leqPp; dgykrk gS bls ;k{ } ls iznf'kZr djrs gSA ;fn fdlh leqPp; esa de ls de ,d vo;o fo|eku gks rks og leqPp;
vfjDr leqPp; dgykrk gSA
,dy leqPp; (Singleton set) : ;fn fdlh leqPPk; esa dsoy ,d gh vo;o fo|eku gks] mls ,dy leqPp; dgrs gSA
ifjfer leqPp; (Finite set) : ,d leqPp; ftlesa fo|eku vo;oksa dh la[;k fuf'pr gks] ifjfer leqPp; dgykrk gSA
ifjfer leqPp; dh dksfV (Order of a finite set) : fdlh ifjfer leqPp; A esa fo|eku fofHkUu vo;oksa dh la[;k
dks ifjfer leqPp; dh dksfV dgrs gS rFkk bls O(A) ;k n(A) }kjk iznf'kZr djrs gSA bls leqPp; dh Øelwpd la[;k
(Cardinal number) Hkh dgrs gSA
mnkgj.k A = {a, b, c, d}  n(A) = 4
vifjfer leqPp; (Infinite set) : ,d leqPp; ftlesa fo|eku vo;oksa dh la[;k vfuf'pr (vuUr) gks vifjfer leqPp;
dgykrk gS
leku leqPp; (Equal set) : ;fn leqPp; A dk izR;sd vo;o B dk vo;o gks rFkk leqPp; B dk izR;sd vo;o leqPp;
A dk vo;o gks] rks nks leqPp; A vkSj B leku leqPp; dgykrs gSA ;fn leqPp; A rFkk B leku gS rks bls A = B ls
fy[krs gSA ;fn leqPp; A rFkk B leku leqPp; ugha gks rc A  B fy[krs gSA
ADVSRF -1
rqY; leqPp; (Equivalent set) : nks ifjfer leqPp; A rFkk B rqY; leqPp; dgykrs gS ;fn budh Øelwpd la[;k
leku gks vFkkZr~ n(A) = n(B)
mnkgj.k % A = {1, 3, 5, 7}, B = {a, b, c, d}
 n(A) = 4 rFkk n(B) = 4  A rFkk B rqY; leqPp; gSA
fVIi.kh : leku leqPp; lnSo rqY; leqPp; gksrs gS tcfd rqY; leqPp; leku leqPp; ugha gks ldrs gSA
mnkgj.k # 4 : fuEufyf[kr leqPp;ksa dk izdkj crkb;sA
(i) A = {x  W : 3  x < 10} (ii) A = {}
(iii) A = {1, 0, –1, –2, –3,.......} (iv) A = {1, 8, –2, 6, 5} rFkk B = {1, 8, –2, 1, 6, 5}
(v) A = {x : x d+{kk esa fo|kFkhZ;ksa dh la[;k gS}
gy : (i) ifjfer leqPp; (ii) ifjfer leqPp;
(iii) vifjfer leqPp; (iv) leku leqPp;
(v) ,dy leqPp;
vH;kl dk;Z iz'u :
(1) mu lHkh iw.kkZadksa 'x' dk leqPp; fyf[k;s rkfd –2 < x – 4 < 5.
(2) leqPp; {1, 2, 5, 10} dks leqPp; fuekZ.k :i esa fyf[k;sA
(3) ;fn A = {x : x2 < 9, x  Z} rFkk B = {–2, –1, 1, 2} rks Kkr djks fd leqPp; A rFkk B leku leqPp; gS ;k
ughaA
mÙkj (1) {3, 4, 5, 6, 7, 8}
(2) {x : x ,d izkd`r la[;k gS rFkk 10 dk Hkktd gS}
(3) leku leqPp; ugha gSA
mileqPp; rFkk vf/kleqPp; (SUBSET AND SUPERSET) :
ekuk nks leqPp; A vkSj B bl izdkj gS fd leqPp; A dk izR;sd vo;o leqPp; B dk Hkh vo;o gS rks leqPp; A dks leqPp;
B dk mileqPp; dgk tkrk gS rFkk leqPp; B dks leqPp; A dk vf/kleqPp; dgk tkrk gSA bls A  B }kjk iznf'kZr
djrs gSA
mnkgj.k % A = {1, 2, 3, 4} rFkk B = {1, 2, 3, 4, 5, 6, 7}  A  B
;fn A, B dk mileqPp; ugha gS rks ge fy[krs gS fd A / B
mfpr mileqPp; (PROPER SUBSET ) :
;fn leqPp; A, leqPp; B dk mileqPp; gks rFkk A  B rc leqPp; A leqPp; B dk mfpr mileqPp; dgykrk gS
rFkk bls A  B }kjk O;Dr djrs gSA leqPp; A, leqPp; A dk mfpr mileqPp; ugha gksrk gS blfy, ;g A dk vuqfpr
mileqPp; (Improper subset) dgykrk gSA
fVIi.kh : (i) izR;sd leqPp; Lo;a dk mileqPp; gksrk gSA
(ii) fjDr leqPp;  izR;sd leqPp; dk mileqPp; gksrk gSA
(iii) A  B rFkk B  A  A = B
(iv) ;fn fdlh ifjfer leqPp; esa vo;oksa dh la[;k n gks] rks mlds mileqPp;ksa dh la[;k 2n gksxh A
(v) ;fn fdlh leqPp; esa vo;oksa dh la[;k n gks] rks mlds mfpr mileqPp;ksa dh la[;k 2n – 1 gksxhA
(vi) fjDr leqPp; , Lo;a dks NksM+dj izR;sd leqPp; dk mfpr mileqPp; gksrk gSA
?kkr leqPp; (POWER SET) :
ekuk A ,d leqPp; gSaA leqPp; A ds lHkh laHkkfor mileqPp;ksa ds leqPp; dks leqPp; A dk ?kkr leqPp; dgrs gS rFkk
bls P(A) }kjk O;Dr djrs gSA
mnkgj.k # 5 : fuEu dFku lR; gS ;k vlR;] dh tk¡p dhft,
(i) {a} / {b, c, a} (ii) {x, p} / {x : x vaxzsth o.kZekyk dk ,d Loj gSA}
(iii) {}  {} (iv) {a, b} {a, {a}, b, c}
ADVSRF -2
gy : (i) vlR; D;ksafd {a}, {b, c, a} dk ,d mileqPp; gSA (ii) vlR; D;ksafd x, p Loj gSA
(iii) vlR; D;ksafd vo;o ,  leqP;; {} esa fLFkr ugha gSA
(iv) vlR; D;ksfda a, b {a, {a}, b, c} rFkk {a, b}  {a, {a}, b, c}
mnkgj.k # 6 : leqP;; A = {1, 2, 3} dk ?kkr leqP;; Kkr dhft,A
gy : P(A) = {, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}}
mnkgj.k # 7 : ;fn  fjDr leqP;; dks fu:fir djrk gS rks Kkr dhft,A
(a) P()
(b) P(P())
(c) n(P(P(P())))
(d) n(P(P(P(P()))))
gy : (a) P() = {}
(b) P(P()) = {,{}}
(c) n(P(P(P()))) = 22 = 4
(d) n(P(P(P(P())))) = 24 = 16
vH;kl dk;Z iz'u :

(4) lR;@vlR; dh foospuk dhft, : A = {p, q, r, s}, B = {p, q, r, p, t} rks A  B.
(5) lR;@vlR; dh foospuk dhft, : A = {p, q, r, s}, B = {s, r, q, p} rks A  B.
(6) lR;@vlR; dh foospuk dhft, : [4, 15)  [–15, 15]
mÙkj (4) vlR; (5) vlR; (6) lR;
lkoZf=kd ¼le"Vh;½ leqPp; (UNIVERSAL SET ) :
og leqPp; ftlesa ,d fo'ks"k lanHkZ ds lHkh laHko vo;o fLFkr gks] lkoZf=kd leqPp; dgykrk gS rFkk bls lkekU;r% U ls
fu:fir djrs gSA
mnkgj.k ;fn A = {1, 2, 3}, B = {2, 4, 5, 6}, C = {1, 3, 5, 7} rks U = {1, 2, 3, 4, 5, 6, 7} bldk lkoZf=kd leqPp; fy;k
tk ldrk gSA
leqPp;ksa ij dqN lafØ;k;sa (SOME OPERATION ON SETS) :
(i) nks leqPp;ksa dk la?k ¼lfEeyu½ : A  B = {x : x  A or x  B}
mnkgj.k A = {1, 2, 3}, B = {2, 3, 4} rks A  B = {1, 2, 3, 4}
(ii) nks leqPp;ksa dk loZfu"B : A  B = {x : x  A rFkk x  B}
mnkgj.k A = {1, 2, 3}, B = {2, 3, 4} rks A  B = {2, 3}
(iii) nks leqPp;ksa dk vUrj : A – B = {x : x  A rFkk x  B}. bls AB' Hkh fy[kk tk ldrk gSA
blh izdkj B – A = B  A' mnkgj.k A = {1, 2, 3}, B = {2, 3, 4} ; A – B = {1}
(iv) leqPp;ksa dk lefer varj : bls A  B }kjk fu:fir fd;k tkrk gS rFkk A  B = (A – B)  (B – A)
(v) leqPp;ksa dk iwjd : A' = {x : x  A fdUrq x  U} = U – A
mnkgj.k U = {1, 2,........, 10}, A = {1, 2, 3, 4, 5} rks A' = {6, 7, 8, 9, 10}
(vi) folaf?kr leqPp; : ;fn A  B =  rks A, B folaf?kr leqPp; gksaxsA
mnkgj.k ;fn A = {1, 2, 3}, B = {7, 8, 9} rks A  B = 
osu vkjs[k (VENN DIAGRAM) :

leqPp;ksa ds e/; vf/kdka'k laca/kksa dks vkjs[kksa }kjk fu:fir fd;k tk ldrk gS] ftUgsa osu vkjs[k dgrs gSA bu vkjs[kksa esa lkoZf=kd
leqPp; dks ,d vk;r }kjk rFkk lkoZf=kd leqPp; ds mileqPp;ksa dks vk;r ds vUnj o`Ùkksa }kjk iznf'kZr djrs gSA leqPp;ksa
ds vo;oksa dks muds laxr o`Ùkksa ds vUnj fy[kk tkrk gSA
ADVSRF -3
mnkgj.k ds fy, ;fn A = {1, 2, 3}, B = {3, 4, 5}, U = {1, 2, 3, 4, 5, 6, 7, 8} rks budk osu vkjs[k fuEu gksxk
AB AB A–B B–A
A' (A B) = (A – B)  (B – A) folaf?kr leqPp;
leqPp;ksa ds chtxf.kr ds fu;e (leqPp;ksa ds xq.k/keZ)

(LAWS OF ALGEBRA OF SETS (PROPERTIES OF SETS)) :
(i) Øefofues; fu;e : (A  B) = B  A ; A  B = B  A
(ii) lkgp;Z fu;e : (A  B)  C = A  (B  C) ; (A  B)  C = A  (B  C)
(iii) caVu ¼forj.k½ fu;e : A (B  C) = (A  B)  (A  C) ; A  (B  C) = (A  B)  (A  C)
(iv) Mh-eksxZu fu;e : (A  B)' = A'  B' ; (A  B)' = A'  B'
(v) rRled fu;e : A  U = A ; A   = A
(vi) iwjd fu;e : A  A' = U, A  A' = , (A')' = A
(vii) oxZle fu;e : A  A = A, A  A = A
NOTE : (i) A – (B  C) = (A – B)  (A – C) ; A – (B  C) = (A – B)  (A – C)
(ii) A   = , A  U = U
mnkgj.k # 8 : ekuk A = {1, 2, 3, 4, 5, 6} rFkk B = {4, 5, 6, 7, 8, 9} rks A  B Kkr dhft,A

gy : A  B = {1, 2, 3, 4, 5, 6, 7, 8, 9}
mnkgj.k # 9 : ekuk A = {1, 2, 3, 4, 5, 6}, B = {4, 5, 6, 7, 8, 9}. rks A – B rFkk B – A Kkr dhft,A
gy : A – B = {x : x  A rFkk x  B} = {1, 2, 3} blh izdkj B – A = {7, 8, 9}
mnkgj.k # 10 : lR; ;k vlR; dh foospuk dhft, :

(i) A  A = A (ii) U A = A
gy : (i) vlR; D;ksafd A  A' = U
(ii) lR; D;ksafd U A = A
mnkgj.k # 11 : osu vkjs[k dh lgk;rk ls fl) dhft, fd A – B = A  B.
gy :
osu vkjs[k ls ge fu"d"kZ fudky ldrs gS fd A – B = A  B.

ADVSRF -4
vH;kl dk;Z iz'u :
(7) ;fn A = {x : x = 2n + 1, n  5, n  N} rFkk B = {x : x = 3n – 2, n  4, n  N} rks A  B Kkr dhft,A
(8) ;fn A = {5, 9, 13, 17, 21} rFkk B = {3, 6, 9, 12, 15, 18, 21, 24} rks A – (A – B) Kkr dhft,A
mÙkj (7) {1, 3, 4, 5, 7, 9, 10, 11} (8) {9, 21}
leqPp; esa vo;oksa dh la[;k ij vk/kkfjr dqN egÙoiw.kZ ifj.kke

(SOME IMPORTANT RESULTS ON NUMBER OF ELEMENTS IN SETS) :
;fn A, B, C ifjfer leqPp; gS rFkk U ifjfer loZfu"B leqPp; gS] rks
(i) n(A  B) = n(A) + n(B) – n(A  B)
(ii) n(A – B) = n(A) – n(A  B)
(iii) n(A  B  C) = n(A) + n(B) + n(C) – n(A  B) – n(B  C) – n(A  C) + n(A  B  C)
(iv) leqPp;ksa A, B, C esa ls Bhd nks leqPp;ksa esa fLFkr vo;oksa dh la[;k
= n(A  B) + n(B  C) + n(C  A) – 3n(A  B  C)
(v) leqPp;ksa A, B, C esa ls Bhd ,d leqPp; esa fLFkr vo;oksa dh la[;k
= n(A) + n(B) + n(C) – 2n(A  B) – 2n(B  C) – 2n(A  C) + 3n(A  B  C)
mnkgj.k # 12 : 60 fo|kfFkZ;ksa ds ,d lewg esa] 36 vxzsath v[kckj i<+rs gS, 22 fgUnh v[kckj i<+rs gS rFkk 12 nksuksa esa ls dksbZ Hkh
v[kckj ugha i<+rs gS] rks fdrus fo|kFkhZ vxzsath rFkk fgUnh nksuksa v[kckj i<+rs gS \
gy n(U) = 60, n(E) = 36, n(H) = 22
n(E  H) = 12  n(E  H) = 12
 n(U) – n(E  H) = 12  n(E  H) = 48
 n(E) + n(H) – n(E  H) = 48  n(E  H) = 58 – 48 = 10
mnkgj.k # 13 : 50 O;fDr;ksa ds ,d lewg esa] 14 O;fDr pk; ihrs gS ysfdu dkWQh ugha ihrs gS rFkk 30 O;fDr pk; ihrs gS rks Kkr
dhft,
(i) fdrus O;fDr pk; rFkk dkWQh nksuksa ihrs gS ? (ii) fdrus O;fDr dkWQh ihrs gS ysfdu pk; ugha ihrs gSA
gy T : pk; ihus okys O;fDr
C : dkWQh ihus okys O;fDr
(i) n(T) = n(T – C) + n(T  C)
 30 = 14 + n(T  C)
 n(T  C) = 16
(ii) n(C – T) = n(T  C) – n(T) = 50 – 30 = 20

vH;kl dk;Z iz'u :
(9) ekuk A rFkk B nks ifjfer leqP;; bl izdkj gS fd n(A – B) = 15, n(A  B) = 90, n(A  B) = 30 rks n(B)
Kkr dhft,A
(10) ,d cktkj vuqla/kku leqg 1000 miHkksDrkvksa dk losZ{k.k fd;k rFkk lwfpr fd;k fd 720 miHkksDrkvksa us mRikn
A rFkk 450 miHkksDrkvksa us mRikn B ilan fd;kA nksuksa mRiknksa dks ilan djus okys miHkksDrkvksa dh U;wure
la[;k D;k gksxh \
mÙkj (9) 75 (10) 170
lEcU/k (RELATIONS)
Øfer ;qXe (ORDERED PAIR) :

Øfer ;qXe oLrqvksa dk og ;qXe gS] ftls ,d fo'ks"k Øe esa lewfgr fd;k tkrk gSA Øfer ;qXe dks nks oLrqvksa dks ,d fo'ks"k
Øe esa fy[kdj rFkk vYifojke }kjk i`Fkd djds] bl ;qXe dks oØ dks"Bd esa fy[kk tkrk gSA
Øfer ;qXe (a, b) esa] a izFke vo;o dgykrk gS rFkk b f}rh; vo;o dgykrk gSA
nks Øfer ;qXe leku gksrs gS ;fn muds laxr vo;o leku gksA
vFkkZr~ (a, b) = (c, d) ;fn a = c rFkk b = d.
ADVSRF -5
dkrhZ; xq.ku (CARTESIAN PRODUCT) :
nks vfjDr leqPp;ksa A dk B ls dkrhZ; xq.ku mu lHkh laHko Øfer ;qXeksa (a, b) dk leqPp; gksxk tgk¡ a  A rFkk b  B
vFkkZr~ {(a, b) ; a  A rFkk b  B} rFkk bls A × B ls fu:fir fd;k tkrk gSA lkekU;r% A × B  B × A.
blh izdkj A × B × C = {(a, b, c) : a  A, b  B, c  C} Øfer f=kd dgykrk gSA
lEcU/k (RELATION) :
ekuk A rFkk B nks leqPp; gS] rks leqPp; A ls B esa ifjHkkf"kr ,d lEcU/k R, A × B dk mileqPp; gksrk gSA vr% ;fn A
ls B esa ifjHkkf"kr ,d lEcU/k R gS  R  A × B ;g mileqPp; A × B ds Øfer ;qXeksa ds izFke vo;o rFkk f}rh; vo;oksa
ds e/; ,d lEcU/k LFkkfir djus ls izkIr gksrk gSA
mnkgj.k % ;fn A = {1, 2, 3, 4, 5, 6, 7, 8} rFkk B = {1, 2, 3, 4, 5} rFkk R = {(a, b) : a = b2, a  A, b  B} rks
R = {(1, 1), (4, 2), (9, 3)}. ;gk¡ a R b  1 R 1, 4 R 2, 9 R 3.
NOTE :
(i) ekuk A rFkk B nks vfjDr ifjfer leqPp; gS rFkk buesa vo;oksa dh la[;k Øe'k% m rFkk n gS rks A × B esa Øfer
;qXeksa dh la[;k mn gksxhA blfy;s A × B ds mileqPp;ksa dh la[;k vFkkZr~ A ls B esa ifjHkkf"kr lEcU/kksa dh dqy
la[;k 2mn gksrh gSA
(ii) A ls A esa lEcU/k dks "A ij lEcU/k" dgrs gSA
lEcU/k dk izkar rFkk ifjlj (DOMAIN AND RANGE OF A RELATION) :
ekuk leqPp; A ls leqPp; B esa ,d lEcU/k R gS rks lEcU/k R ds Øfer ;qXeksa ds lHkh izFke ?kVdksa ds leqPp; dks
lEcU/k R dk izkra dgrs gSA tcfd lacU/k R ds Øfer ;qXeksa ds lHkh f}rh; ?kVdksa ds leqPp; dks lEcU/k R dk ifjlj dgrs gSA
vr% , R dk izkUr = {a : (a, b)  R} rFkk R dk ifjlj = {b : (a, b)  R}
ifjHkk"kk ls Li"V gS fd A ls B esa lEcU/k dk izkUr A dk mileqPp; gksrk gS rFkk bldk ifjlj B dk mileqPp; gksrk gSA
mnkgj.k # 14 : ;fn A = {1, 2} rFkk B = {3, 4} rks A × B Kkr dhft,A
gy : A × B = {(1, 3), (1, 4), (2, 3), (2, 4)}
mnkgj.k # 15 : ekuk A = {1, 3, 5, 7} rFkk B = {2, 4, 6, 8} nks leqPp; gS rFkk A ls B esa ,d lEcU/k R fuEu izdkj ifjHkkf"kr gSA
"(x, y)  R  x > y". rks lEcU/k R Kkr dhft, rFkk bldk izkUr rFkk ifjlj Hkh Kkr dhft,A
gy : lEcU/k R ds fy;s, 3R2, 5R2, 5R4, 7R4 rFkk 7R6
vFkkZr~ R = {(3, 2), (5, 2), (5, 4), (7, 2), (7, 4), (7, 6)}
 R dk izkUr = {3, 5, 7} rFkk R dk ifjlj = {2, 4, 6}
mnkgj.k # 16 : ekuk fd A = {2, 3, 4, 5, 6, 7, 8, 9}. ekukfd R, A ij ifjHkkf"kr ,d lEcU/k gS

{(x, y) : x  A, y  A vkSj x2 = y ;k x = y2}
R dk çkUr o ifjlj Kkr dhft,.
gy : lEcU/k R gS
R = {(2, 4), (3, 9), (4, 2), (9, 3)}
R dk çkUr = {2, 3, 4, 9}
R dk ifjlj = {2, 3, 4, 9}
vH;kl dk;Z iz'u :

(11) ;fn (2x + y, 7) = (5, y – 3) rks x rFkk y Kkr dhft,A
(12) ;fn A × B = {(1, 2), (1, 3), (1, 6), (7, 2), (7, 3), (7, 6)} rks leqPp; A rFkk B Kkr dhft;sA
(13) ;fn A = {x, y, z} rFkk B = {1, 2} rks A ls B esa ifjHkkf"kr lEcU/kksa dh la[;k Kkr dhft,A
(14) R = {(4x + 3, 1 – x) : x  2, x  N} Kkr dhft,A
5
mÙkj (11) x = – , y = 10 (12) A = {1, 7}, B = {2, 3, 6}
2
(13) 64 (14) {(7, 0), (11, –1)}
ADVSRF -6
lEcU/kksa ds izdkj (TYPES OF RELATIONS) :
bl Hkkx esa ge fn;s x;s leqPp; A ij ifjHkkf"kr fofHkUu izdkj ds lEcU/kksa dk v/;;u djsaxsA
(i) fjDr lacU/k (Void relation) : leqPp; A ij ifjHkkf"kr ,d lEcU/k R ,d fjDr lEcU/k dgykrk gS] ;fn A
dk dksbZ Hkh vo;o A ds fdlh Hkh vo;o ls lacfU/kr ugha gS vFkkZr~ R =   A × A leqPp; A ij ,d fjDr
lEcU/k dgykrk gSA
(ii) lkoZf=kd lEcU/k (Universal relation) : leqPp; A ij ifjHkkf"kr lEcU/k R, ,d lkoZf=kd lEcU/k dgykrk gS]
;fn A dk izR;sd vo;o A ds lHkh vo;oksa ls lEcfU/kr gks vFkkZr~ R = A × A  A × A
(iii) rRled Qyu (Identity relation) : leqPp; A ij ifjHkkf"kr IA = {(a, a) : a  A}, A ij rRled lEcU/k
dgykrk gSA nwljs 'kCnksa esa leqPp; A ij ifjHkkf"kr ,d lEcU/k IA rRled lEcU/k dgykrk gS ;fn A dk izR;sd
vo;o Lo;a ,oa dsoy Lo;a ls lEcfU/kr gSA
(iv) LorqY; lEcU/k (Reflexive relation) : leqPp; A ij ifjHkkf"kr ,d lEcU/k R LorqY; dgykrk gS] ;fn A dk
izR;sd vo;o Lo;a ls lEcfU/kr gS vr% leqPp; A ij ifjHkkf"kr lEcU/k R LorqY; ugha gksxk ;fn ;gk¡ ,d vo;o
a  A bl izdkj vfLrRo esa gS fd (a, a)  R.
Note : izR;sd rRled lEcU/k LorqY; gksrk gS ijUrq izR;sd LorqY; lEcU/k rRled lEcU/k ugha gksrk gSA
(v) lefer lEcU/k (Symmetric relation) : leqPp; A ij ifjHkkf"kr ,d lEcU/k R lefer lEcU/k dgykrk gSA
;fn vkSj dsoy ;fn (a, b)  R  (b ,a)  R  a, b  A. vFkkZr~ a R b  b R a  a, b  A.
(vi) laØked lEcU/k (Transitive relation) : leqPp; A ij ifjHkkf"kr ,d lEcU/k R laØked lEcU/k dgykrk gS
;fn vkSj dsoy ;fn (a, b)  R rFkk (b, c)  R  (a, c)  R  a, b, c  A vFkkZr~ a R b rFkk b R c
 a R c  a, b, c  A
(vii) rqY;rk lEcU/k (Equivalence relation) : leqPp; A ij ifjHkkf"kr ,d lEcU/k R rqY;rk lEcU/k dgykrk gS
;fn vkSj dsoy ;fn
(i) ;g LorqY; gS vFkkZr~ (a, a)  R  a  A
(ii) ;g lefer gS vFkkZr~ (a, b)  R  (b, a)  R  a, b  A
(iii) ;g laØked gS vFkkZr~ (a, b)  R rFkk (b, c)  R  (a, c)  R  a, b, c  A
mnkgj.k # 17 : fuEu esa ls dkSulk leqPp; A = {1, 2, 3} ij rRled lEcU/k gksxkA
R1 = {(1, 1), (2, 2)}, R2 = {(1, 1), (2, 2), (3, 3), (1, 3)}, R3 = {(1, 1), (2, 2), (3, 3)}.
gy : lEcU/k R3 , leqPp; A ij ,d rRled lEcU/k gksxkA
lEcU/k R1 , leqPp; A ij ,d rRled lEcU/k ugha gksxk D;ksafd (3, 3)  R1.
lEcU/k R2 , leqPp; A ij ,d rRled lEcU/k ugha gksxk D;ksafd (1, 3)  R2
mnkgj.k # 18 : fuEu esa ls dkSulk lEcU/k leqPp; A = {1, 2, 3} ij LorqY; lEcU/k gS
R1 = {(1, 1), (2, 2), (3, 3), (1, 3), (2, 1)}, R2 = {(1, 1), (3, 3), (2, 1), (3, 2)}..
gy : R1 leqPp; A ij LorqY; lEcU/k gSA
R2 leqPp; A ij LorqY; lEcU/k ugha gS D;ksafd 2  A ijUrq (2, 2)  R2.
mnkgj.k # 19 : fl) djks fd izkd`r la[;kvksa ds leqPp; N ij ifjHkkf"kr ,d lEcU/k R, x R y  'x, y ls NksVk gSA'] ,d
laØked lEcU/k gSA
gy : fdlh x, y, z  N ds fy,] x < y rFkk y < z  x < z  x R y rFkk y R z  x R z vr% R ,d laØked
lEcU/k gksxkA
mnkgj.k # 20 : ekuk T fdlh lery esa fLFkr leLr f=kHkqtksa dk leqPp; gS rFkk lEcU/k R, leqPp; T esa bl izdkj gS
R = {(T1 , T2) : T1, T2 ds lok±xle gS}. iznf'kZr dhft, fd R ,d rqY;rk lEcU/k gSA
gy : lEcU/k R, leqPp; T ij rqY;rk lEcU/k gksxk ;fn R LorqY;] lefer o laØked gksA
(i) pwafd izR;sd f=kHkqt Lo;a ds lok±xle gksrk gSA
 R LorqY; lEcU/k gSA
(ii) (T1 , T2)  R  T1, T2 ds lok±xle gSA  T2 ,T1 ds lok±xle gSA  (T2, T1)  R
vr% R lefer gSA
(iii) ekuk (T1, T2)  R rFkk (T2, T3)  R
 T1, T2 ds lok±xle gS
ADVSRF -7
vkSj T2, T3 ds lok±xle gS
 T1, T3 ds lok±xle gS
 (T1, T3)  R  R laØked gS
vr% R ,d rqY;rk lEcU/k gksxkA
mnkgj.k # 21 : iznf'kZr dhft;s dh okLrfod la[;kvks ds leqPp; R esa ifjHkkf"kr lEcU/k R = {(a, b) : a  b} laØked gSA
gy : ekuk (a, b)  R rFkk (b, c)  R
 a  b rFkk b  c  a  c
 (a, c)  R vr% R laØked gSA
mnkgj.k # 22 : iznf'kZr dhft;s fd leqPp; {1, 2, 3} esa laca/k R tks fd R = {(1, 2), (2, 1)} ls fn;k gS] lefer gSA
gy : ekuk (a, b)  R [ (1, 2)  R]
 (b, a)  R [ (2, 1)  R]
vr% R lefer gSA
vH;kl dk;Z iz'u :
(15) ekuk L fdlh lery esa fLFkr leLr js[kkvksa dk ,d leqPp; gS rFkk leqPp; L ij ,d lEcU/k R fu;e
'(x ,y)  R  x, y ds yEcor gSA', }kjk ifjHkkf"kr gS] rks fl) dhft, fd R leqPp; L ij ,d lefer
lEcU/k gksxkA
(16) ekuk R ,d lery esa fLFkr leLr js[kkvksa ds leqPp; ij '(1, 2)  R  js[kk 1,2 ds lekUrj gSA'
}kjk ifjHkkf"kr ,d lEcU/k gS] rks fl) dhft, fd R ,d rqY;rk lEcU/k gSA
Qyu (FUNCTION)
ifjHkk"kk (Definition) :
Qyu fdlh vfjDr leqPp; A ls vfjDr leqPp; B esa ,d fo'ks"k izdkj dk fu;e ¼;k laxrrk½ gS ftlds vUrxZr
A ds izR;sd vo;o dk] B ds vf}rh; vo;o ls lEc) gksrk gSA izrhdkRed :i esa f: A  B fy[krs gS& bls ge
^^f, leqPp; A ls leqPp; B esa ,d Qyu gSA^^ i<+rs gSA
mnkgj.kr% ekukfd A  {–1, 0, 1} ,oa B  {0, 1, 2}. rc A × B{(–1, 0), (–1, 1), (–1, 2), (0, 0), (0, 1), (0, 2),
(1, 0), (1, 1), (1, 2)} vc, " f : A  B, f(x) = x2 }kjk ifjHkkf"kr ,d Qyu gS rks
f  {(–1, 1), (0, 0), (1, 1)}
Qyu f dks vkjs[kh; :i esa fuEu fp=k }kjk Hkh n'kkZ;k tk ldrk gSA
A B
uksV : izR;sd Qyu y = f(x) : A  B tgk¡ x Lora=k pj gSa ftldk eku leqPp; A dk dksbZ vo;o tcfd y dk eku leqPp;
B dk dksbZ vo;o gSA ;g lEcU/k Qyu gksxk ;fn vkSj dsoy ;fn (i) x leqPp; A dk izR;sd eku ys ldrk gks
rFkk (ii) x ds ,d eku ds fy, leqPp; B esa y dk dsoy ,d eku gksA
Graphically : ;fn dksbZ m/okZ/kj js[kk vkys[k dks ,d ls vf/kd fcUnqvksa ij izfrPNsn djrh gks] rks ;g vkys[k Qyu
dks iznf'kZr ugha djrk gS&
mnkgj.k # 23 : (i) fuEufyf[kr esa ls dkSu&dkSu lEcU/k] Qyu gSA
(A) f(x) = x 3 ; {–1, 0, 1}  {0, 1, 2, 3}
(B) f(x) = ± x ; {0, 1, 4}  {–2, –1, 0, 1, 2}
ADVSRF -8
(C) f(x) = x ; {0, 1, 4}  {–2, –1, 0, 1, 2}
(D) f(x) = – x ; {0, 1, 4}  {–2, –1, 0, 1, 2}
(ii) fuEufyf[kr esa ls dkSuls vkjsf[kr ys[kkfp=k Qyu dks iznf'kZr djrs gS&
(A) (B)
(C) (D)
gy : (i) (C) ,oa (D) esa Qyu dh ifjHkk"kk lUrq"V gS tcfd (A) dh fLFkfr esa fn;k x;k laEcU/k Qyu ugha gS] tSls
f(–1)  lgizkUr vr% Qyu dh ifjHkk"kk lUrq"V ugha gksrh gSA
tcfd (B) dh fLFkfr esa fn;k x;k lEcU/k Qyu ugha gS] pw¡fd f(1) = ± 1 ,oa f(4) = ± 2 vFkkZr izkUr esa 1
,oa 4 lgizkUr ds nks vo;oksa ls laEcf/kr gSA vr% Qyu dh ifjHkk"kk lUrq"V ugha gSA
(ii) (B vkSj D)
(A) esa izkUr ds ,d vo;o dk izfrfcEc lgizkUr esa ugha gS tcfd (C) esa izkUr ds ,d vo;o ds nks izfrfcEc
lgizkUr esa gSA
vH;kl dk;Z :
(17) ekuk [1, 1] ij ifjHkkf"kr Qyu g(x) gSA ;fn leckgq f=kHkqt ftlds nks 'kh"kZ (0,0) ,oa (x,g(x)) ij gS] dk
{ks=kQy 3 / 4 oxZ bdkbZ gS] rks Qyu g(x) gks ldrk gS&
2
(A) g(x)=  (1  x ) (B) g(x) = (1  x 2 ) (C) g(x) =  (1  x 2 ) (D) g(x) = (1  x 2 )
(18) {} ls {1, 2} esa ifjHkkf"kr lHkh laHko Qyu iznf'kZr dhft,A
Answers : (17) A, B, C
(18) (i) (ii) (iii) (iv)
Qyu dk iz k Ur] lgiz k Ur ,oa ifjlj (Domain, Co-domain & Range of a Function) :
;fn f: A  B }kjk ifjHkkf"kr dksbZ ,d Qyu gks rks leqPp; A Qyu f dk izkUr rFkk leqPp; B Qyu f dk lgizkUr
dgykrk gSA
;fn x1 dk izfrfp=k.k y1 gks] rks y1 dks f ds vUrxZr x1 dk izfrfcEc ,oa x1 dks y1 dk iwoZ izfrfcEc dgrs gSA
;fn dsoy Qyu f (x) fn;k x;k gks ¼izkUr ,oa lgizkUr ugha n'kkZ, x, gksA½ rks izkUr] ' x' ds mu ekuksa dk leqPp;
gS ftuds fy, Qyu f (x) okLrfod gS tcfd lgizkUr (– , ) fy;k tkrk gSA (ITFs ds vykok)
ifjlj y ds ekuksa dk iw.kZ leqPp; gksrk gS Li"Vr;k ifjlj lgizkUr dk mileqPp; gksrk gS
,slk Qyu ftlds izkUr o ifjlj nksuksa okLrfod la[;kvksa ds mileqPp; gks] rks og okLrfod Qyu dgykrk gSA
mnkgj.k # 24 : fuEufyf[kr Qyuksa dk izkUr Kkr dhft,&
(i) f(x) = x2  5 (ii) sin–1 (2x – 1)
gy : (i) f(x) = x2  5 okLrfod gS ;fn vkSj dsoy ;fn x2 – 5  0
 |x|  5  x  – 5 ;k x  5
 f dk izkUr (–, – 5 ]  [ 5 , ) gSA
(ii) sin–1 (2x – 1) okLrfod gS ;fn vkSj dsoy ;fn –1  2x – 1  + 1
 izkUr x  [0, 1] gSA
ADVSRF -9
ONLY ONE OPTION CORRECT TYPE

dsoy ,d lgh fodYi çdkj ONLY ONE OPTION CORRECT TYPE
* Marked Questions may have more than one correct option.

* fpfUgr iz'u ,d ls vf/kd lgh fodYi okys iz'u gS -
 Marked Questions may have for Revision Questions.
 fpfUgr iz'u nksg jkus ;ksX; iz' u gSA
1. The set of intelligent students in a class is-

(1) a null set (2) a singleton set
(3) a finite set (4*) not a well defined collection
,d d{kk ds cqf)eku Nk=kksa dk leqPp; gS &
(1) fjDr leqPp; (2) ,dy leqPp; (3) ifjfer leqPp; (4) ,d lqifjHkkf"kr laxzg ugha gSA
2. Which of the following is the empty set

(1) {x : x is a real number and x2 – 1 = 0} (2*) {x : x is a real number and x2 + 1 = 0}
(3) {x : x is a real number and x2 – 9 = 0} (4) {x : x is a real number and x2 = x + 2}
fuEu esa ls dkSulk fjDr leqPp; gS&
(1) {x : x ,d okLrfod la[;k gS rFkk x2 – 1 = 0} (2*) {x : x ,d okLrfod la[;k gS rFkk x2 + 1 = 0}
(3) {x : x ,d okLrfod la[;k gS rFkk x2 – 9 = 0} (4) {x : x ,d okLrfod la[;k gS rFkk x2 = x + 2}
3. The set A = {x : x R, x2 = 16 and 2x = 6} is

leqPp; A = {x : x R, x2 = 16 rFkk 2x = 6} gS&
(1*) Null set (2) Singleton set (3) Infinite set (4) None of these
(1*) fjDr leqPp; (2) ,dy leqPp; (3) vifjfer leqPp; (4) buesa ls dksbZ ugha
4. If A = {x : –3 < x < 3, x  Z} then the number of subsets of A is -

;fn leqPp; A = {x : –3 < x < 3, x  Z} rc A ds mileqPp;ksa dh la[;k gksxh &
(1) 120 (2) 30 (3) 31 (4*) 32
5. Which of the following are true ?

fuEu esa ls dkSulk lR; gS ?
(1*) [3, 7]  (2, 10) (2) (0, )  (4, ) (3) (5, 7]  [5, 7) (4) [2, 7]  (2.9, 8)
6. The number of subsets of the power set of set A = {7, 10, 11} is
leqPp; A = {7, 10, 11} ds ?kkr leqPp; ds mileqPp;ksa dh la[;k gSµ
(1) 32 (2) 16 (3) 64 (4*) 256
7. Sets A and B have 3 and 6 elements respectively. What can be the minimum number of elements in AB ?
leqPp; A rFkk B esa vo;oksa dh la[;k Øe'k% 3 rFkk 6 gks] rc AB esa de ls de fdrus vo;o gks ldrs gS &
(1) 3 (2*) 6 (3) 9 (4) 18
Toll Free : 1800 200 2244 | 1800 258 5555 | CIN: U80302RJ2007PTC024029
ADVSRF - 10
8. Given the sets A = {1, 2, 3}, B = {3, 4}, C = {4, 5, 6}, then A  (B  C) is
;fn A = {1, 2, 3}, B = {3, 4}, C = {4, 5, 6}, gks rc A  (B  C) gS&
(1) {3} (2*) {1, 2, 3, 4} (3) {1, 2, 4, 5} (4) {1, 2, 3, 4, 5, 6}
9. Let A = {x : x  R, –1 < x < 1} , B = {x : x  R, x  0 or x  2} and A B = R – D, then the set D is

(1) {x : 1 < x  2} (2*) {x : 1  x < 2} (3) {x : 1  x  2} (4) None of these
ekuk A = {x : x  R, –1 < x < 1}, B = {x : x  R, x  0 ;k x  2} rFkk A B = R – D, rc leqPp; D gS&
(1) {x : 1 < x  2} (2*) {x : 1  x < 2} (3) {x : 1  x  2} (4) buesa ls dksbZ ugha
10. The smallest set A such that A  {1, 2} = {1, 2, 3, 5, 9} is

(1) {2, 3, 5} (2*) {3, 5, 9} (3) {1, 2, 5, 9} (4) None of these
leqPp; A bl izdkj gS fd A  {1, 2} = {1, 2, 3, 5, 9} rks U;wure leqPp; A gS&
(1) {2, 3, 5} (2*) {3, 5, 9} (3) {1, 2, 5, 9} (4) buesa ls dksbZ ugha
11. Let A and B be two sets. Then

(1) n(A  B)  n(A  B) (2*) n(A  B)  n(A  B)(3) n(A  B) = n(A  B) (4) None of these
ekuk A vkSj B nks leqPp; gSa] rc
(1) n(A  B)  n(A  B) (2*) n(A  B)  n(A  B)(3) n(A  B) = n(A  B) (4) buesa ls dksbZ ugha
12. If A = {2, 3, 4, 8, 10}, B = {3, 4, 5, 10, 12}, C = {4, 5, 6, 12, 14} then (A  B)  (A  C) is equal to
;fn A = {2, 3, 4, 8, 10}, B = {3, 4, 5, 10, 12}, C = {4, 5, 6, 12, 14} rc (A  B)  (A  C) cjkcj gS&
(1*) {3, 4, 10} (2) {2, 8, 10} (3) {4, 5, 6} (4) {3, 5, 14}
13. The shaded region in the given figure is

fn;s x;s fp=k esa Nka;kfdr Hkkx n'kkZrk gS &
(1) A  (B  C) (2) A  (B  C) (3) A  (B – C) (4*) A – (B  C)
14. Let n(U) = 700, n(A) = 200, n(B) = 300 and n(A  B) = 100, then n(A'  B') =
ekuk n(U) = 700, n(A) = 200, n(B) = 300 rFkk n(A  B) = 100, rc n(A'  B') =
(1) 400 (2) 600 (3*) 300 (4) 200
15. Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, A = {1, 2, 5}, B = {6, 7}, then A  Bis
ekuk U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, A = {1, 2, 5}, B = {6, 7}, rc A  B gS&
(1) B (2*) A (3) A (4) B
16. If X = {4n – 3n – 1 : n  N} and Y = {9(n – 1) ; n  N}, then X Y is equal to

(1) X (2*) Y (3) N (4) None of these
;fn X = {4n – 3n – 1 : n  N} rFkk Y = {9(n – 1) ; n  N}, rc X Y =
(1) X (2*) Y (3) N (4) buesa ls dksbZ ugha
ADVSRF - 11
17. If A = {x : x = 4n + 1, n  5, n  N} and B {3n : n  8, n  N}, then A – (A – B) is :
;fn A = {x : x = 4n + 1, n  5, n  N} rFkk B {3n : n  8, n  N}, rc A – (A – B) cjkcj gS :
(1*) {9, 21} (2) {9, 12} (3) {6, 12} (4) {6, 21}
18. A  B = A  B iff :
A  B = A  B ;fn vkSj dsoy ;fn
(1) A  B (2*) A = B (3) A  B (4) A  B
19. If aN = {ax : x  N} and bN  cN = dN, where b, c  N, b  2, c  2 are relatively prime, then which one of the
following is correct ? [SCRA-2007, (2, –1/3)/100]
;fn aN = {ax : x  N} vkSj bN  cN = dN, tgk¡ b, c  N, b  2, c  2 lg vHkkT; gS] rc fuEu es ls dkSulk lgh gS?
[SCRA-2007, (2, –1/3)/100]
(1) b = cd (2) c = bd (3*) d = bc (4) d2 = bc
20. Let A1, A2 and A3 be subsets of a set X. Which one of the following is correct ?
(1*) A1  A2  A3 is the smallest subset of X containing elements of each of A1, A2 and A3
(2) A1  A2  A3 is the smallest subset of X containing either A1 or A2  A3 but not both
(3) The smallest subset of X containing A1  A2 and A3 equals the smallest subset of X containing both A1 and
A2  A3 only if A2 = A3
(4) None of these
[SCRA-2009, (2, –1/3)/100]
ekuk A1, A2 vkSj A3 leqPp; X ds mileqPp; gSa A fuEu esa ls dkSulk lgh gS?
(1*) A1  A2  A3 , leqPp; X dk lcls NksVk mileqPp; gS tks A1, A2 vkSj A3 izR;sd ds vo;oksa dks j[krk gSA
(2) A1  A2  A3, leqPp; X dk lcls NksVk mileqP;; gS tks ;k rks A1 ;k A2  A3 dks j[krk gS ijUrq nksuksa dks ughaA
(3) X dk lcls NksVk mileqPp; tks A1  A2 rFkk A3 rFkk X dk lcls NksVk mileqPp; gS tks A1 vkSj A2  A3 nksuksa dks
j[krk gS] leku gksaxsa dsoy ;fn A2 = A3
(4) buesa ls dksbZ ugha
[SCRA-2009, (2, –1/3)/100]
21. Let U be set with number of elements in U is 2009.

Consider the following statements :
 If A, B are subsets of U with n (A  B) = 280, then n(A B) = x13 + x 32 = y13 + y 32
for some positive integers x1, x2 y1, y2
 If A is a subset of U with n (A) = 1681 and out of these 1681 elements, exactly 1075 elements belong to a
subset B of U  then n (A – B) = m2 + p1 p2 p3 for some positive integer m and distinct primes p1, p2, p3
Which of the statements given above is / are correct ? [SCRA-2009, (2, –1/3)/100]
(1) I only (2) II only (3*) Both I and II (4) Neither I nor II.
ekuk U ,d leqPp; nks vo;oksa dh la[;k 2009 gSA
ekukfd fuEu dFku :
 ;fn A, B, U ds mileqPp; gSa ftuesa n (A  B) = 280 rc n(A B) = x13 + x 32 = y13 + y 32
/kukRed iw.kkZadks x1, x2 y1, y2 ds fy,
 ;fn A,U dk mileqPp; gS ftlesa n (A) = 1681 vkSj bu 1681 vo;oksa esa ls, Bhd 1075 vo;o] Uds mileqPp B
dks j[krk gS rc n (A – B) = m2 + p1 p2 p3 fdlh /kukRed iw.kkZad m vkSj fofHkUu vHkkT; la[;k,sa dsoy p1, p2, p3 ds fy,
fuEu esa ls dkSuls dFku lgh gS\ [SCRA-2009, (2, –1/3)/100]
(1) dsoy I (2) dsoy II (3*) I vkSj II nksuksa (4) u rks I vkSj u gh II.
ADVSRF - 12
22. Let A, B, C be distinct subsets of a universal set U. For a subset X of U, let X ' denote the complement of X
in U.
Consider the following sets :
1. ((A  B) C) B) = B  C
2. (A   B )(A  B C) = (A (B  C))
Which of the above statements is/are correct ? [SCRA-2011, (2, –1/3)/100]
(1) 1 only (2*) 2 only (3) Both 1 and 2 (4) Neither 1 nor 2
ekuk fd lkoZfu"B leqPp; U ds fofHkUu mileqPp;ksa A, B, C gSA U ds mileqPp; X ds fy,] ekuk X ', U es X ds iwjd leqPp;
dks O;Dr djrk gSA
ekuk fd fuEu leqPp; :
1. ((A  B) C) B) = B  C
2. (A   B )(A  B C) = (A (B  C))
fuEu es ls dkSuls dFku lgh gS ? [SCRA-2011, (2, –1/3)/100]
(1) dsoy 1 (2*) dsoy 2 (3) 1 vkSj 2 nksuksa (4) u rks 1 vkSj u gh 2
23. Consider the following statements :

1. N  (B  Z) = (N B) Z for any subset B of R, where N is the set of positive integers, Z is the set
of integers, R is the set of real numbers.
2. Let A = {n  N : 1  n  24, n is a multiple of 3}. There exists no subset B of N such that the number
of elemets in A is equal to the number of elements in B.
(1*) 1 only (2) 2 only (3) Both 1 and 2 (4) Neither 1 nor 2
ekuk fd dFku :
1. R ds fdlh mileqPp; B ds fy, N  (B  Z) = (N B) Z tgk¡ N /kukRed iw.kkZadksa dk leqPp; gS vkSj Z iw.kkZadks
dk leqPp; gS, R okLrfod la[;kvksa dk leqPp; gSA
2. ekuk A = {n  N : 1  n  24, n,3 dk xq.kt gSA} N dk bl izdkj dk dksbZ mileqPp; B ugha gS ftlesa A esa
vo;oksa dh la[;k] B esa vo;oksa dh la[;k ds cjkcj gSA
rc fuEu esa ls dkSulk dFku lgh gS? [SCRA-2011, (2, –1/3)/100]
(1*) dsoy 1 (2) dsoy 2 (3) 1 vkSj 2 nksuksa (4) u rks 1 vkSj u gh 2
24. Consider the following statements :

1. If A = {(x, y)  [R × R : x3 + y3 = 1] and B = {(x, y)  [R : x – y = 1]}, then A  B contains exactly one
elements.
2. If A = {(x, y)  [R × R : x3 + y3 = 1] and B = {(x, y)  [R : x + y = 1]}, then A  B contains exactly two
elements.
(1) 1 only (2) 2 only (3*) Both 1 and 2 (4) Neither 1 and 2
ekuk dh dFku :
1. ;fn A = {(x, y)  [R × R : x3 + y3 = 1] vkSj B = {(x, y)  [R : x – y = 1]}, rc A  B, Bhd ,d vo;o j[krk gSA
2. ;fn A = {(x, y)  [R × R : x3 + y3 = 1] vkSj B = {(x, y)  [R : x + y = 1]}, rc A  B Bhd nks vo;o j[krk gSA
fuEu es ls dkSulk dFku lgh gS ? [SCRA-2012, (2, –1/3)/100]
(1) dsoy 1 (2) dsoy 2 (3*) 1 vkSj 2 nksuksa (4) u rks 1 vkSj u gh 2
25. Which of the following venn-diagrams best represents the sets of females, mothers and doctors ?
fuEu esa dkSulk osu&vkjs[k leqPp; efgyk,a] ekrk,a] fpfdRldksa ds fy, lcls vf/kd mi;qDr gS&
(1) (2) (3) (4*)
ADVSRF - 13
26. In a college of 300 students, every student reads 5 newspapers and every newspaper is read by 60
students. The number of newspaper is-
(1) at least 30 (2) at most 20 (3*) exactly 25 (4) none of these
,d dkWyst esa Nk=kksa dh la[;k 300 gS] izR;sd Nk=k 5 v[kckj i<rk gS rFkk izR;sd v[kckj dks 60 Nk=kksa }kjk i<+k tkrk gSA
rc v[kckjksa dh la[;k gksxh &
(1) de ls de 30 (2) vf/kdre 20 (3*) Bhd 25 (4) buesa ls dksbZ ugha
27. In a town of 10,000 families it was found that 40% families buy newspaper A, 20% families buy newspaper B
and 10% families 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 news papers, then number of families which buy newspaper A only is
;fn fdlh 'kgj ds 10,000 ifjokjksa esa ls 40% ifjokj lekpkj i=k A, 20% ifjokj lekpkj i=k B, 10% ifjokj lekpkj
i=k C rFkk 5% ifjokj A vkSj B, 3 % ifjokj B vkSj C rFkk 4% ifjokj A vkSj C dks [kjhnrs gSa o 2% ifjokj lHkh rhu
lekpkj i=k [kjhnrs gS] rks mu ifjokjksa dh la[;k D;k gksxh tks dsoy lekpkj i=k A [kjhnrsa gSa&
(1) 3100 (2*) 3300 (3) 2900 (4) 1400
28.* A and B are two sets such that n(A) = 3 and n(B) = 6, then
(1*) minimum value of n(A  B) = 6 (2) minimum value of n(A  B) = 9
(3) maximum value of n(A  B) = 6 (4*) maximum value of n(A  B) = 9
A vkSj B nks
leqPp; bl izdkj gS fd n(A) = 3 vkSj n(B) = 6, rc
(1*) n(A  B) dk U;wure eku = 6 (2) n(A  B) dk U;wure eku = 9
(3) n(A  B) dk vf/kdre eku = 6 (4*) n(A  B) dk vf/kdre eku = 9
29. Of the members of three athletic teams in a school 21 are in the cricket team, 26 are in the hockey team and
29 are in the football team. Among them, 14 play hockey and cricket, 15 play hockey and football, and 12
play football and cricket. Eight play all the three games. The total number of members in the three athletic
teams is :
,d fo|ky; dh rhu ,FkysfVDl Vhe ds lnL;ksa esa ls 21 fØdsV Vhe esa] 26 gkWdh Vhe esa rFkk 29 QqVckWy Vhe esa gSaA buesa
ls 14 gkWdh rFkk fØdsV] 15 gkWdh rFkk QqVckWy rFkk 12 QqVckWy rFkk fØdsV [ksyrs gSaA rhuksa [ksy 8 lnL; [ksyrs gSa] rc
rhuksa ,FkysfVDl Vhe ds lnL;ksa dh dqy la[;k gS &
(1) 34 (2) 20 (3) 64 (4*) 43
30. In a class of 42 students, the number of students studying different subjects are 23 in Mathematics, 24 in
Physics, 19 in Chemistry, 12 in Mathematics and Physics 9 in Mathematics and Chemistry, 7 in Physics
and Chemistry and 4 in all the three subjects. The number of students who have taken exactly one subject
is
fdlh d{kk ds 42 Nk=kksa esa ls fofHkUu fo"k;ksa es ls 23 Nk=k xf.kr] 24 HkkSfrdh] 19 jlk;u] 12 xf.kr vkSj HkkSfrdh] 9 xf.kr
vkSj jlk;u] 7 HkkSfrdh vkSj jlk;u rFkk 4 lHkh rhuksa fo"k; i<+rs gSa] rks Bhd ,d fo"k; i<+us okys Nk=kksa dh la[;k gS&
(1) 15 (2) 30 (3*) 22 (4) 27
31. In a city 20 percent of the population travels by car, 50 percent travels by bus and 10 percent travels by
both car and bus. Then persons travelling by car or bus is
(1) 80 percent (2) 40 percent (3*) 60 percent (4) 70 percent
fdlh uxj dh tula[;k ds 20 % dkj ls ;k=kk djrs gSa] 50 % cl ls rFkk 10 % dkj vkSj cl nksuksa ls ;k=kk djrsa gSa]
rks dkj vFkok cl ls ;k=kk djus okys O;fDr;ksa dh la[;k gksxh&
(1) 80 % (2) 40 % (3*) 60 % (4) 70 %
ADVSRF - 14
32. A class has 175 students. The following data shows the number of students obtaining one or more
subjects : Mathematics 100, Physics 70, Chemistry 40, Mathematics and Physics 30, Mathematics and
Chemistry 28, Physics and Chemistry 23, Mathematics & Physics & Chemistry 18. How many students
have offered Mathematics alone ?
,d d{kk esa 175 fo|kFkhZ gSaA fuEu vk¡dM+s ;g iznf'kZRk djrsa gSa fd fdrus fo|kFkhZ ,d ;k ,d ls vf/kd fo"k; dk p;u
djrs gS % xf.kr 100, HkkSfrdh 70, jlk;u 40, xf.kr vkSj HkkSfrd 30, xf.kr vkSj jlk;u 28, HkkSfrd vkSj jlk;u 23,
xf.kr vkSj HkkSfrd vkSj jlk;u 18, rc fdrus fo|kfFkZ;ksa ds ikl dsoy xf.kr fo"k; gS&
(1) 35 (2) 48 (3*) 60 (4) 22
33. 31 candidates appeared for an examination, 15 candidates passed in Mathematics, 15 candidates passed in
physics, 20 candidates passed in Chemistry . 3 candidates passed only in Mathematics. 4. candidates
passed only in Physics, 7 candidates passed only in Chemistry. 2 candidates passed in all the three
subjects How many candidates passed only in two subjects ? [SCRA-2005, (2, –1/3)/100]
,d ijh{kk esa 31 fo|kFkhZ cSBrs gS ftuesa 15 fo|kFkhZ xf.kr esa] 15 fo|kFkhZ HkkSfrdh esa] 20 fo|kFkhZ jlk;u esa] 3 fo|kFkhZ dsoy
xf.kr esa ikl gksrs gS] 4 fo|kFkhZ dsoy HkkSfrdh esa ikl gksrs gS] 7 fo|kFkhZ dsoy jlk;u esa ikl gksrs gS vkSj 2 fo|kFkhZ lHkh
rhu fo"k; esa ikl gks tkrs gS rc dsoy nks fo"k; fdrus fo|kFkhZ ikl gksrs gS\ [SCRA-2005, (2, –1/3)/100]
(1) 17 (2*) 15
(3) 22 (4) 14
34. In an examination of a certain class, at least 70% of the students failed in Physics, at least 72% failed in
Chemistry, at least 80% failed in Mathematics and at least 85% failed in English. How many at least must
have failed in all the four subjects ? [SCRA-2011, (2, –1/3)/100]
(1) 5% (2*) 7%
(3) 15% (4) Cannot be determined due to insufficient data
,d d{kk dh ijh{kk esa HkkSfrdh esa de ls de 70% fo|kFkhZ Qsy gksrs gS] de ls de 72% fo|kFkhZ jlk;u esa Qsy gksrs gS]
de ls de 80% fo|kFkhZ xf.kr esa Qsy gksrs gS vkSj de ls de 85% fo|kFkhZ vxzsath esa Qsy gksrs gS rc de ls de bu
lHkh pkjks fo"k;ksa esa fdrus fo|kFkhZ Qsy gksrs gS? [SCRA-2011, (2, –1/3)/100]
(1) 5% (2*) 7%
(3) 15% (4) vi;kZIr vkdM+ksa ds vk/kkj ij Kkr ugha fd;k tk ldrk gSA
35. If A = {a, b}, B = {c, d}, C = {d, e}, then {(a, c), (a, d), (a, e), (b, c), (b, d), (b, e)} is equal to
;fn A = {a, b}, B = {c, d}, C = {d, e}, rc {(a, c), (a, d), (a, e), (b, c), (b, d), (b, e)} =
(1) A  (B  C) (2) A  (B  C) (3*) A × (B  C) (4) A × (B  C)
36. If A = {2, 4, 5}, B = {7, 8, 9}, then n(A × B) is equal to

;fn A = {2, 4, 5}, B = {7, 8, 9}, rks n(A × B) dk eku gS&
(1) 6 (2*) 9 (3) 3 (4) 0
37. If A = {x : x2 – 5x + 6 = 0}, B = {2, 4}, C = {4, 5} then A × (B  C) is-

;fn A = {x : x2 – 5x + 6 = 0}, B = {2, 4}, C = {4, 5} gks] rks A × (B  C) gS -
(1*) {(2, 4), (3, 4)} (2) {(4, 2), (4, 3)} (3) {(2, 4), (3, 4), (4, 4)} (4) {(2, 2), (3, 3), (4, 4), (5, 5)}
38. Let A = {a, b, c} and B = {1, 2}. Consider a relation R defined from set A to set B. Then R can equal to set
ekuk A = {a, b, c} rFkk B = {1, 2} ekuk lEcU/k R leqPp; A ls B esa ifjHkkf"kr gSA rc lEcU/k R fdl leqPp; ds cjkcj
gks ldrk gS&
(1) A (2) B (3*) A × B (4) B × A
ADVSRF - 15
39. A and B are two sets having 3 and 4 elements respectively and having 2 elements in common. The number
of relation which can be defined from A to B is
(1) 25 (2) 210 – 1 (3) 212 – 1 (4*) none of these
A vkSj B nks leqPp; gS ftuesa vo;oksa dh la[;k Øe'k% 3 vkSj 4 gS vkSj nksuksa esa 2 vo;o mHk;fu"B gSA rc A ls B esa ifjHkkf"kr
lEcU/kksa dh la[;k gS&
(1) 25 (2) 210 – 1 (3) 212 – 1 (4) buesa ls dksbZ ugha
40. Let R be relation from a set A to a set B, then

ekuk leqPp; A ls leqPp; B esa ,d lEcU/k R gS] rc &
(1) R = A  B (2) R = A  B (3*) R  A × B (4) R  B × A
41. Let X = {1, 2, 3, 4, 5} and Y = {1, 3, 5, 7, 9}. Which of the following is not a relation from X to Y
ekuk X = {1, 2, 3, 4, 5} rFkk Y = {1, 3, 5, 7, 9} fuEu esa ls dkSulk X ls Y esa lEcU/k ugha gS&
(1) R1 = {(x, y) | y = 2 + x, x  X, y  Y} (2) R2 = {(1, 1), (2, 1), (3, 3), (4, 3), (5, 5)}
(3) R3 = {(1, 1), (1, 3) (3, 5), (3, 7), (5, 7)} (4*) R4 = {(1, 3), (2, 5), (2, 4), (7, 9)}
42. Let A = {1, 2, 3, 4} and R be a relation in A given

by R = {(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (2, 1), (3, 1), (1, 3)}, then relation R is
(1) Reflexive (2) Symmetric (3) Equivalence (4*) Reflexive and Symmetric
ekuk A = {1, 2, 3, 4} rFkk A esa ifjHkkf"kr ,d lEcU/k R fuEu gS&
R = {(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (2, 1), (3, 1), (1, 3)} rc lEcU/k R gS&
(1) LorqY; (2) lefer (3) rqY;rk lEcU/k (4*) LorqY; ,oa lefer
43. The relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)} on set A = {1, 2, 3} is
(1*) Reflexive but not symmetric (2) Reflexive but not transitive
(3) Symmetric and Transitive (4) Neither symmetric nor transitive
leqPp; A = {1, 2, 3} ij lEcU/k R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)} gS&
(1*) LorqY; ysfdu lefer ugha (2) LorqY; ysfdu laØked ugha
(3) lefer rFkk laØked (4) u rks lefer u gh laØked
44. The relation ''less than'' in the set of natural number is

(1) Only symmetric (2*) Only transitive (3) Only reflexive (4) Equivalence relation
izkd`r la[;kvksa ds leqPp; esa ifjHkkf"kr lEcU/k ''lss de'' gS&
(1) dsoy lefer (2*) dsoy laØked (3) dsoy LorqY; (4) rqY;rk lEcU/k
45. The relation R defined in N as aRb b is divisible by a is

(1*) Reflexive but not symmetric (2) Symmetric but not transitive
(3) Symmetric and transitive (4) None of these
N esa aRb b, a ls HkkT; gS] ls ifjHkkf"kr lEcU/k R gS&
(1*) LorqY; ijUrq lefer ugha (2) lefer ijUrq laØked ugha
(3) lefer rFkk laØked (4) buesa ls dksbZ ugha
46. In the set A = {1, 2, 3, 4, 5} a relation R is defined by R = {(x, y)| x, y  A and x < y}. Then R is
(1) Reflexive (2) Symmetric (3*) Transitive (4) None of these
ADVSRF - 16
leqPp; A = {1, 2, 3, 4, 5} ij ,d lEcU/k R = {(x, y)| x, y  A rFkk x < y} }kjk ifjHkkf"kr gS rc R gS&
(1) LorqY; (2) lefer (3*) laØked (4) buesa ls dksbZ ugha
47. For real numbers x and y, we write x R y  x – y + 2 is an irrational number. Then the relation R is-
(1*) Reflexive (2) Symmetric (3) Transitive (4) None of these
okLrfod la[;kvksa x vkSj y ds fy, ges fn;k gS fd x R y  x – y + 2 ,d vifjes; la[;k gSA rc lEcU/k R
gksxk&
(1) LorqY; (2) lefer (3) laØked (4) buesa ls dksbZ ugha
48. Which one of the following relations on R is equivalence relation-

(1*) x R1y  x2 = y2 (2) x R2y  x  y (3) x R3y  x | y (x divides y) (4) x R4y  x < y
fuEUk esa ls dkSulk lEcU/k R esa ,d rqY;rk lEcU/k gksxk &
(1*) x R1y  x2 = y2 (2) x R2y  x  y
(3) x R3y  x | y (x foHkkftr djrk gS y dks) (4) x R4y  x < y
49. The relation R defined in A = {1, 2, 3} by a R b if –5  a2 – b2  5. Which of the following is false-

(1*) R = {(1, 2), (2, 2), (3, 3), (2, 1), (2, 3), (3, 2)} (2) Co-domain of R = {1, 2, 3}
(3) Domain of R = {1, 2, 3} (4) Range of R = {1, 2, 3}
leqPp; A = {1, 2, 3} esa ,d lEcU/k R, aRb ls ifjHkkf"kr gSA ;fn –5  a2 – b2  5 fuEu esa ls dkSulk vlR; gS
(1) R = {(1, 2), (2, 2), (3, 3), (2, 1), (2, 3), (3, 2)} (2) R dk lgizkUr = {1, 2, 3}
(3) R dk izkUr = {1, 2, 3} (4) R dk ifjlj = {1, 2, 3}
50. Let P = {(x, y) | x2 + y2 = 1, x, y  R}, then P is

(1) reflexive (2*) symmetric (3) transitive (4) equivalence
2 2
ekuk P = {(x, y) | x + y = 1, x, y  R} rc P gS&
(1) LorqY; (2) lefer (3) laØked (4) rqY;rk lEcU/k
51. Let A = {p, q , r}. Which of the following is an equivalence relation on A ?

(1) R1 = {(p, q), (q, r), (p, r) (p, p)} (2) R2 = {(r, q), (r, p), (r, r) (q, q)}
(3) R3 = {(p, p), (q, q), (r, r) (p, q)} (4*) none of these
ekuk A = {p, q , r}. fuEu esa ls dkSulk A esa rqY;rk lEcU/k gS ?
(1) R1 = {(p, q), (q, r), (p, r) (p, p)} (2) R2 = {(r, q), (r, p), (r, r) (q, q)}
(3) R3 = {(p, p), (q, q), (r, r) (p, q)} (4) buesa ls dksbZ ugha
52. Let R1 be a relation defined by R1 = {(a, b)| a  b ; a, b  R} . Then R1 is

(1) An equivalence relation on R (2*) Reflexive, transitive but not symmetric
(3) Symmetric, Transitive but not reflexive (4) Neither transitive nor reflexive but symmetric
ekuk R1 = {(a, b)| a  b ; a, b  R} }kjk ifjHkkf"kr LkEcU/k R1 gS] rc R1 gS&
(1) R ij rqY;rk lEcU/k (2*) LorqY;] laØked] ijUrq lefer ugha
(3) lefer] laØked] ijUrq LorqY; ugha (4) u rks laØked u gh LorqY; ijUrq lefer gSA
53. Let L denote the set of all straight lines in a plane. Let a relation R be defined by R ,, L.
The R is
(1) Reflexive (2*) Symmetric (3) Transitive (4) None of these
ADVSRF - 17
ekuk fdlh ry esa fLFkr lHkh ljy js[kkvksa ds leqPp; dks L ls fu:fir fd;k tkrk gS rFkk R ,, L }kjk
ifjHkkf"kr ,d lEcU/k R gS] rc R gS&
(1) LorqY; (2*) lefer (3) laØked (4) buesa ls dksbZ ugha
54. Let S be the set of all real numbers. Then the relation R =
{(a, b) : 1 + ab > 0} on S is
(1*) Reflexive and symmetric but not transitive (2) Reflexive, transitive but not symmetric
(3) Symmetric, transitive but not reflexive (4) Reflexive, transitive and symmetric
ekuk lHkh okLrfod la[;kvksa dk leqPp; S gSa] rc S ij ifjHkkf"kr lEcU/k R = {(a, b) : 1 + ab > 0} gS&
(1*) LorqY;
vkSj lefer ysfdu laØked ugha (2) LorqY; vkSj laØked ysfdu lefer ugha
(3) lefer vkSj laØked ysfdu LorqY; ugha (4) LorqY;] lefer vkSj laØked
55. Let R be a relation on the set N be defined by {(x, y)| x, y  N, 2x + y = 41}. Then R is
(1) Reflexive (2) Symmetric (3) Transitive (4*) None of these
ekuk lEcU/k R, leqPp; N ij {(x, y)| x, y  N, 2x + y = 41} }kjk ifjHkkf"kr gS] rc R gS&
(1) LorqY; (2) lefer (3) laØked (4*) buesa ls dksbZ ugha
56. Let A = N × N be the Certesian product of N and N. Let

S = {((m, n), (p, q))  A × A : m + q = n + p}
Consider the following statements:
I.If ((m,n), (p , q))  S, and ((p,q), (r, s))  S then ((r,s), (m,n))  S
II.There exists at least one element ((m,n), (p, q))  S such that ((p , q), (m, n))  S
Which of the statements given above is / are correct ? [SCRA-2009, (2, –1/3)/100]
(1*) I only (2) II only (3) Both I and II (4) Neither I nor II.
ekuk A = N × N, N vkSj N dk dkrhZ; xq.ku gS ekuk
S = {((m, n), (p, q))  A × A : m + q = n + p}
ekuk fd dFku :
I. ;fn ((m,n), (p , q))  S, vkSj ((p,q), (r, s))  S rc ((r,s), (m,n))  S
II.de ls de ,d vo;o ((m,n), (p, q))  S bl izdkj gS fd ((p , q), (m, n))  S
fuEu dFkuksa esa ls dkSulk lgh gS? [SCRA-2009, (2, –1/3)/100]
(1*) dsoy I (2) dsoy II (3) I vkSj II nksuksa (4) u rks I vkSj u gh II.
57. Let A = Z, the set of integers. Let R1 = {(m, n)  Z × Z : (m + 4n) is divisible by 5 in Z}.
Let R2 = {(m, n)  Z × Z : (m + 9n) is divisible by 5 in Z}.
Which one of the following is correct ? [SCRA-2011, (2, –1/3)/100]
(1) R1 is a proper subset of R2 (2) R2 is a proper subset of R1
(3*) R1 = R2 (4) R1 is not a symmetric relation on Z
ekuk A = Z iw.kk±dksa dk leqPp; gSA ekuk R1 = {(m, n)  Z × Z : (m + 4n), Z esa 5 ls foHkkftr gS}
ekuk R2 = {(m, n)  Z × Z : (m + 9n), Z esa 5 ls foHkkftr gS}
fuEu es ls dkSulk lgh gS ? [SCRA-2011, (2, –1/3)/100]
(1) R1 , R2 dk mfpr mileqPp; gSA (2) R2 , R1 dk mfpr mileqPp; gSA
(3*) R1 = R2 (4) R1 , Z ij lefer lEcU/k ugh gS
58. Consider the following :

1. If R = {(a, b)  N × N : a divides b in N} then the relation R is reflexive and symmetric but not
transitive.
2. If A = {1, 2, 3, 4, 5, 6} and R = {(S1, S2) : S1, S2 are subsets of A, S1 S2}, then the relation R is not
reflexive, not symmetric and not transitive.
Which of the statements is/are correct ? [SCRA-2011, (2, –1/3)/100]
(1) 1 only (2*) 2 only (3) Both 1 and 2 (4) Neither 1 nor 2
ADVSRF - 18
ekukfd dFku gS :
1. ;fn R = {(a, b)  N × N : N esa a, b dks foHkkftr djrk gS rc lEcU/k R LorqY; vkSj lefer gS ijUrq laØked
ughaA
2. ;fn A = {1, 2, 3, 4, 5, 6} vkSj R = {(S1, S2) : S1, S2 ,A ds mileqPp; gS, S1 S2} rc lEcU/k R LorqY; ugha]
lefer ugha vkSj laØked ughaA
fuEe esa ls dkSuls dFku lgh gS? [SCRA-2011, (2, –1/3)/100]
(1) dsoy 1 (2*) dsoy 2 (3) 1 vkSj 2 nksuksa (4) u rks 1 vkSj u gh 2
59. Let X be the set of all persons living in a state. Elements x, y in X are said to be related if ‘x < y’, whenever
y is 5 years older than x. Which one of the following is correct? [SCRA-2012, (2, –1/3)/100]
(1) The relation is an equivalence relation
(2) The relation is transitive only
(3) The relation is transitive and symmetric, but not reflexive
(4*) The relation is neither reflexive, nor symmetric, nor transitive
ekukfd X ,d jkT; esa lHkh O;fDr;ksa dk leqPp; gSA X esa vo;o x vkSj y bl izdkj ls lEcfU/kr gS fd ‘x < y’, tcfd
y, x ls 5 o"kZcM+k gS rc fuEu esa ls dkSulk dFku lgh gS\ [SCRA-2012, (2, –1/3)/100]
(1) lEcU/k rqY;rk lEcU/k gSA
(2) lEcU/k dsoy laØked gSA
(3) lEcU/k laØked vkSj lefer gS ijUrq LorqY; ughaA
(4*) lEcU/k u rks LorqY; gS vkSj u gh lefer vkSj laØked gSA
60. If A = {1, 2, 3} and B = {1, 2} and C = {4, 5, 6}, then what is the number of elements in the set A  B  C ?
;fn A = {1, 2, 3} vkSj B = {1, 2} vkSj C = {4, 5, 6}, rc leqpP; A  B  C esa vo;oksa dh la[;k gS ?
[SCRA-2013, (2, –1/3)/100]
(1) 8 (2) 9 (3) 15 (4*) 18
61. If A = {1, 2, 3, 4}, then which of the following is/are the function(s) from A to itself ?
I. f1 = {(x, y)| x + y = 5}
II. f2 = {(x, y)|y < x}
Select the correct answer using the code given below. [SCRA-2014, (2, –1/3)/100]
(1*) I only (2) II only (3) Both I and II (4) Neither I nor II
;fn A = {1, 2, 3, 4}, rc A ls A esa fuEu es ls dkSulk Qyu gS ?
I. f1 = {(x, y)| x + y = 5}
II. f2 = {(x, y)|y < x}
fups fn, x, dksM+ dh lgk;rk ls lgh mÙkj dk p;u djsaA [SCRA-2014, (2, –1/3)/100]
(1*) dsoy I (2) dsoy II (3) I vkSj II nksuksa (4) u rks I vkSj u gh II
Comprehension # 1 (Q. 62 to 64)
In a group of 1000 people, there are 750 people, who can speak Hindi and 400 people, who can speak
Bengali.
62. Number of people who can speak Hindi only is

(1) 300 (2) 400 (3) 500 (4*) 600
63. Number of people who can speak Bengali only is

(1) 150 (2*) 250 (3) 50 (4) 100
64. Number of people who can speak both Hindi and Bengali is
(1) 50 (2) 100 (3*) 150 (4) 200
ADVSRF - 19
vuqPNsn # 1 (Q. 62 to 64)
1000 O;fDr;ksa ds lewg esa ls 750 O;fDr fgUnh vkSj 400 O;fDr caxkyh cksy ldrs gSaA
62. dsoy fgUnh cksyus okys O;fDr;ksa dh la[;k gS&

(1) 300 (2) 400 (3) 500 (4*) 600
63. dsoy caxkyh cksyus okys O;fDr;ksa dh la[;k gS&

(1) 150 (2*) 250 (3) 50 (4) 100
64. fgUnh vkSj caxkyh nksuksa Hkk"kk,a cksyus okys O;fDr;ksa dh la[;k gS -
(1) 50 (2) 100 (3*) 150 (4) 200
Comprehension # 2 (Q. 65 to 67)

vuqPNsn # 2 (Q. 65 to 67)
Let R be a relation defined as R = { (x, y) : y = x – 12 , x  Z and –3  x  3}
ekuk R ,d lEcU/k gS tks fd R = { (x, y) : y = x – 12 , x  Z rFkk –3  x  3} ls ifjHkkf"kr gSA
65. Relation R is equal to :

(1) {(1, 0), (1, 2), (3, 2), (4, 3)} (2*) {(–3, 4), (–2, 3), (–1, 2), (0, 1), (1, 0), (2, 1), (3, 2)}
(3) {(4, –3), (3, –2), (2 –1), (1, 0), (2, 3)} (4) None of these
lEcU/k R cjkcj gS&
(1) {(1, 0), (1, 2), (3, 2), (4, 3)} (2*) {(–3, 4), (–2, 3), (–1, 2), (0, 1), (1, 0), (2, 1), (3, 2)}
(3) {(4, –3), (3, –2), (2 –1), (1, 0), (2, 3)} (4) buesa ls dksbZ ugha
66. Domain of R is :
R dk izkUr gS&
(1) {0, 1, 2, 3, 4} (2) {1, 3, 4}
(3*) {– 3, – 2, – 1, 0, 1, 2, 3} (4) {0, 1, 2, 3, 4}
67. Range of R is
R dk ifjlj gS&
(1*) {0, 1, 2, 3, 4} (2) {–3, –2, –1, 0, 1, 2, 3}
(3) {–4, –3, –1, –2, 0} (4) {–1, 0, 1, 2, 3, 4}
68. Let n be a fixed positive integer. Define a relation R on the set of integers Z, aRb n|(a – b). Then R is
(1) Symmetric only (2) Transitive only (3) Reflexive only (4*) Equivalence only
ekuk n ,d fuf'pr /kukRed iw.kk±d gSA iw.kk±dksa ds leqPp; Z ij aRb n|(a – b) ls ifjHkkf"kr lEcU/k R' gS] rc R gS&
(1) dsoy lefer (2) dsoy laØked (3) dsoy LorqY; (4*) dsoy rqY;rk
69. Let R be a relation over the set N × N and it is defined by (a, b) R (c, d)  a + d = b + c. Then R is
ekukfd R leqPp; N × N esa ,d lEcU/k gS vkSj ;g (a, b) R (c, d)  a + d = b + c }kjk ifjHkkf"kr fd;k x;k gSA
rc R gS&
ADVSRF - 20
70. Let L be the set of all straight lines in the Euclidean plane. Two lines 1 and 2 are said to be related by the
relation R if 1 is parallel to 2. Then R is
ekukfd L ;qDysfM;u ry esa lHkh js[kkvksa dk leqPp; gSA nks js[kkvksa 1 vkSj 2 lEcU/k R ds }kjk lEcfU/kr dgk tkrk gS
;fn 1, 2 ds lekUrj gSA rc R gS&
71.* For n, m  N, n | m means that n is a factor of m, then relation | is

(1*) Reflexive (2) symmetric (3*) Transitive (4) Equivalence
n, m  N ds fy, n | m dk vFkZ gS fd n, m dk ,d xq.ku[k.M gSA rc lEcU/k gS&
(1) LorqY; (2) lefer (3) laØked (4) rqY;rk
72. Let R = {(x, y) : x, y  A, x + y = 5} where A = {1, 2, 3, 4, 5} then R is

(1) Reflexive (2*) symmetric (3) Transitive (4) Equivalence
ekuk R = {(x, y) : x, y  A, x + y = 5} tgk¡ A = {1, 2, 3, 4, 5} rc R gS
(1) LorqY; (2*) lefer (3) laØked (4) rqY;rk
JEE (MAIN) /BITSAT PROBLEMS (PREVIOUS YEARS)

JEE (MAIN) / BITSAT ¼fiNys o"kksZ½ ds iz'u
* Marked Questions may have more than one correct option.

* fpfUgr iz'u ,d ls vf/kd lgh fodYi okys iz'u gS -
 Marked Questions may have for Revision Questions.
 fpfUgr iz'u nksg jkus ;ksX; iz' u gSA
1. Let W denote the words in the english dictionary. Define the relation R by : R = {(x, y)  W × W | the
words x and y have at least one letter in common}. Then R is- [AIEEE-2006, (3, – 1), 120]
(1*) reflexive, symmetric and not transitive (2) reflexive, symmetric and transitive
(3) reflexive, not symmetric and transitive (4) not reflexive, symmetric and transitive
ekukfd W vaxzsth 'kCn dks"k esa 'kCnksa dks iznf'kZr djrk gSA rc lEcU/k R bl izdkj ifjHkkf"kr gS fd R = {(x, y)  W ×
W| 'kCn x vkSj y esa de ls de ,d v{kj mHk;fu"B gks] rc R gS & [AIEEE-2006, (3, – 1), 120]
(1) LorqY;] lefer vkSj laØked ugha (2) LorqY;] lefer vkSj laØked
(3) LorqY;] lefer ugha vkSj laØked (4) LorqY; ugha] lefer vkSj laØked
2. Let R be the real line. Consider the following subsets of the plane R × R [AIEEE-2008, (3, – 1), 105]
S = {(x, y) : y = x + 1 and 0 < x < 2}
T = {(x, y) : x – y is an integer}
Which one of the following is true ?
(1*) T is an equivalence relation on R but S is not
ADVSRF - 21
(2) Neither S nor T is an equivalence relation on R
(3) Both S and T are equivalence relations on R
(4) S is an equivalence relation on R but T is not
ekuk R okLrfod js[kk gSA lery R × R ds fuEufyf[kr mileqPp; gS&
S = {(x, y) : y = x + 1 ,oa 0 < x < 2}
T = {(x, y) : x – y ,d iw.kk±d gS}
fuEu esa ls dkSulk lR; gS ?
(1*) R ij T ,d rqY;rk lEcU/k gS ijUrq S ughaA
(2) R ij u rks S u gh T rqY;rk lEcU/k gSSA
(3) R ij S ,oa T nksauks rqY;rk LkEcU/k gaSA
(4) R ij S ,d rqY;rk lEcU/k gS ijUrq T ughaA
3. If A, B and C are three sets such that A  B = A C and A  B = A C, then
[AIEEE-2009, (4, – 1), 144]
;fn A, B ,oa C rhu leqPp; bl izdkj gS fd A  B = A C ,oa A  B = A C rc&
(1) A = C (2*) B = C (3) A  B =  (4) A = B
4. Consider the following relations : [AIEEE-2010, (4, – 1), 144]

R : {(x, y)| x ,y are real numbers and x = wy for some rational number w}
m p
S = {  ,  | m, n, p and q are integers such that n, q  0 and qm = pn}
 n q
Then
(1) neither R nor S is an equivalence relation
(2*) S is an equivalence relation but R is not an equivalence relation
(3) R and S both are equivalence relations
(4) R is an equivalence relation but S is not an equivalence relation
fuEufyf[kr lEcU/kksa dks ysus ij &
R : {(x, y)| x ,y okLrfod la[;k,¡ gSa rFkk fdlh ifjes; la[;k w ds fy, x = wy gS}
m p
S = {  ,  | m, n, p rFkk q ,sls iw.kk±d gSa fd n, q  0 rFkk qm = pn}
 n q
rks
(1) u rks R vkSj u gh S rqY;rk lEcU/k gSA
(2*) S ,d rqY;rk lEcU/k gS ysfdu R ,d rqY;rk lEcU/k ugha gSA
(3) R rFkk S nksuksa gh rqY;rk lEcU/k gSA
(4) R ,d rqY;rk lEcU/k gS ysfdu S ,d rqY;rk lEcU/k ugha gSA
5. Let R be the set of real numbers. [AIEEE-2011(Part-, (4, – 1), 120]
Statement-1 : A = {(x, y)  R × R : y – x is an integer} is an equivalence relation on R.
Statement-2 : B = {(x, y)  R × R : x = y for some rational number } is an equivalence relation on R.
(1) Statement-1 is true, Statement-2 is true; Statement-2 is a correct explanation for Statement-1.
(2) Statement-1 is true, Statement-2 is true; Statement-2 is not a correct explanation for Statement-1.
(3*) Statement-1 is true, Statement-2 is false.
(4) Statement-1 is false, Statement-2 is true.
ADVSRF - 22
ekuk R okLrfod la[;kvksa dk leqPp; gS : [AIEEE-2011(Part-, (4, – 1), 120]
dFku-1 : A = {(x, y)  R × R : y – x ,d iw.kk±d gS}, R ij ,d rqY;rk laca/k gSA
dFku-2 : B = {(x, y)  R × R : x = y fdlh ifjes; la[;k ds fy,}, R ij ,d rqY;rk laca/k gSA
(1) dFku-1 lR; gS] dFku-2 lR; gSA dFku-2, dFku-1 dh lgh O;k[;k gSA
(2) dFku-1 lR; gS] dFku-2 lR; gSA dFku-2, dFku-1 dh lgh O;k[;k ugha gSA
(3*) dFku-1 lR; gS] dFku-2 vlR; gSA
(4) dFku-1 vlR; gS] dFku-2 lR; gSA
6. Consider the following relation R on the set of real square matrices of order 3.
R = {(A, B)|A = P–1 BP for some invertible matrix P}. [AIEEE-2011(Part-, (3, – 1), 120]
Statement -1 : R is equivalence relation.
Statement - 2 : For any two invertible 3 × 3 matrices M and N, (MN)–1 = N–1M–1.
(1) Statement-1 is true, statement-2 is a correct explanation for statement-1.
(2*) Statement-1 is true, statement-2 is true; statement-2 is not a correct explanation for statement-1.
(3) Statement-1 is true, statement-2 is false.
(4) Statement-1 is false, statement-2 is true.
fuEu laca/k R dks dksfV 3 ds okLrfod oxZ vkO;wgksa ij fopkfjr dhft,A
R = {(A, B)|A = P–1 BP, fdlh O;qRØe.kh; vkO;wg P ds fy,}.
dFku -1 : R ,d rqY;rk laca/k gSA
dFku - 2 : fdUgha nks O;qRØe.kh; 3 × 3 Øe dh vkO;wgksa M rFkk N ds fy,, (MN)–1 = N–1M–1.
(1) dFku -1 lR; gS] dFku -2 lR; gSA dFku-2 ] dFku -1 dh lgh O;k[;k gSA
(2) dFku -1 lR; gS] dFku-2 lR; gSA dFku-2, dFku-1 dh lgh O;k[;k ugha gSA
(3) dFku -1 lR; gS] dFku-2 vlR; gSA
(4) dFku -1 vlR; gS] dFku-2 lR; gSA
7. The relation "less than" in the set of natural numbers is [BITSAT-2011]

(1) only symmetric (2*) only transistive (3) only reflexive (4) equivalence relation
izkÑr la[;kvksa ds leqPp; es lEcU/k "ls NksVk" gS [BITSAT-2011]
(1) dsoy lefer (2*) dsoy laØked (3) dsoy laØked (4) rqY;rk lEcU/k
8. The relation x = | y | is : [BITSAT-2011]

(1) Symmertric (2) Reflexive
(3*) Transitive (4) Equivalence Relation
lEcU/k x = | y | gS : [BITSAT-2011]
(1) lefer (2) LorqY;
(3*) laØked (4) rqY;rk lEcU/k
9. Let X = {1, 2, 3, 4, 5}. The number of different ordered pairs (Y, Z) that can formed such that Y X, Z  X and
Y  Z is empty, is : [AIEEE-2012, (4, – 1), 120]
ekuk X = {1, 2, 3, 4, 5} gSA blls fufeZr fd, tk ldus okys fofHkUu Øfed ;qXeksa (Y, Z), tks bl izdkj gSa fd Y X, Z
 X rFkk Y  Z fjDr leqPp; gS] dh la[;k gS :
(1) 52 (2*) 35 (3) 25 (4) 53
10. Let A and B two sets containing 2 elements and 4 elements respectively. The number of subsets of A × B
having 3 or more elements is [AIEEE - 2013, (4, –1), 120]
ekuk A rFkk B nks ,sls leqPp; gS ftuesa Øe'k% 2 vo;o rFkk 4 vo;o gSA A × B ds mu mileqPp;ksa dh la[;k] ftuesa
3 vFkok vf/kd vo;o gSa] gS&
(1) 256 (2) 220 (3*) 219 (4) 211
ADVSRF - 23
11. If X = {4n – 3n – 1 : n  N} and Y = {9(n – 1) : n  N}, where N is the set of natural numbers, then X  Y is equal
to [JEE(Main) 2014, (4, – 1), 120]
n
;fn X = {4 – 3n – 1 : n  N} rFkk Y = {9(n – 1) : n  N}, gS] tgk¡ N izkd`Ùk la[;kvksa dk leqPp; gS] rks X  Y cjkcj
gSµ [JEE(Main) 2014, (4, – 1), 120]
(1) X (2*) Y (3) N (4) Y – X
12*. If a set contains m element and another set contains n element. If 56 is the difference between the
number of subsets of both sets then find (m, n) [BITSAT-2014]
;fn ,d leqPp; m vo;o j[krk gS rFkk nqljk leqPp; n vo;o j[krk gS ;fn nksuksa leqPp; ds mileqPp;ksa dh
la[;kvksa dk vUrj 56 gS rc (m, n) gS& [BITSAT-2014]
(1*) 3, 6 (2*) 6, 3 (3) 8, 3 (4) 3, 8
13. Let A and B be two sets containing four and two elements respectively. Then the number of subsets of the set
A × B, each having at least three elements is : [JEE(Main) 2015, (4, –1), 120]
(1) 219 (2) 256 (3) 275 (4) 510
ekuk A rFkk B nks leqPp; gS ftuesa Øe'k% pkj rFkk nks vo;o gSa] rks leqPp; A × B ds mu mileqPp;ksa dh la[;k] ftuesa
izR;sd esa de ls de rhu vo;o gSa] gS : [JEE(Main) 2015, (4, – 1), 120]
(1*) 219 (2) 256 (3) 275 (4) 510
ADVSRF - 24

Set Relation and Functions

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Set Relation and Functions

Uploaded by

Copyright:

Available Formats

Sets, Relations & Function

METHODS TO WRITE A SET :

Example # 2 : Express set B = {x3 : x < 5, x  W} in roster form

Singleton set : A set consisting of a single element is called a singleton set.

Self Practice Problem :

SUBSET AND SUPERSET :

Note : (i) Every set is a subset of itself

(ii) Empty set  is a subset of every set

Example # 7 : If  denotes null set then find

Self Practice Problem :

SOME OPERATION ON SETS :

(ii) Intersection of two sets : A  B = {x : x  A and x  B}

(iii) Difference of two sets : A – B = {x : x  A and x  B}. It is also written as AB'.

(iv) Symmetric difference of sets : It is denoted by A  B and A  B = (A – B)  (B – A)

(v) Complement of a set : A' = {x : x  A but x  U} = U – A

AB AB A–B B–A

A' (A B) = (A – B) (B – A) Disjoint

Example # 8 : Let A = {1, 2, 3, 4, 5, 6} and B = {4, 5, 6, 7, 8, 9} then find A  B

Example # 9 : Let A = {1, 2, 3, 4, 5, 6}, B = {4, 5, 6, 7, 8, 9}. Find A – B and B – A.

Example # 10 : State true or false :

Example # 11 : Use Venn diagram to prove that A – B = A  B.

From venn diagram we can conclude that A – B = A  B.

Self Practice Problem :

(ii) n(A – B) = n(A) – n(A  B)

(iii) n(A  B  C) = n(A) + n(B) + n(C) – n(A  B) – n(B  C) – n(A  C) + n(A  B  C)

(iv) Number of elements in exactly two of the sets A, B, C

(v) Number of elements in exactly one of the sets A, B, C

(ii) n(C – T) = n(T  C) – n(T) = 50 – 30 = 20

Self Practice Problem :

DOMAIN AND RANGE OF A RELATION :

Example#14 : If A = {1, 2} and B = {3, 4}, then find A × B.

Example#16 : Let A = {2, 3, 4, 5, 6, 7, 8, 9}. Let R be the relation on A defined by

(11) If (2x + y, 7) = (5, y – 3) then find x and y.

(13) If A = {x, y, z} and B = {1, 2} then find number of relations from A to B.

(14) Write R = {(4x + 3, 1 – x) : x  2, x  N}

(vii) Equivalence relation : A relation R on a set A is said to be an equivalence relation on A iff

Example#21 : Show that the relation R in R defined as R = {(a, b) : a  b} is transitive.

Self Practice Problem :

Example#23 : (i) Which of the following correspondences can be called a function ?

(D) f(x) = – x ; {0, 1, 4}  {–2, –1, 0, 1, 2}

(ii) Which of the following pictorial diagrams represent the function

(18) (i) (ii)

Domain, Co-domain and Range of a Function :

If x 1 is mapped to y1, then y1 is called as image of x 1 under f. Further x 1 is a pre-image of y1 under f.

Example#24 : Find the domain of following functions :

 the domain of f is (–, – 5 ]  [ 5 , )

mnkgj.k # 1 : leqPp; A = {x : x  N rFkk x = 2n tgk¡ n  N} dks jksLVj :i esa fyf[k;sA

mnkgj.k # 2 : leqPp; B = {x3 : x < 5, x  W} dks jksLVj :i esa fyf[k;s

leqPp;ksa ds izdkj (TYPES OF SETS)

vH;kl dk;Z iz'u :

osu vkjs[k (VENN DIAGRAM) :

AB AB A–B B–A

A' (A B) = (A – B)  (B – A) folaf?kr leqPp;

leqPp;ksa ds chtxf.kr ds fu;e (leqPp;ksa ds xq.k/keZ)

mnkgj.k # 8 : ekuk A = {1, 2, 3, 4, 5, 6} rFkk B = {4, 5, 6, 7, 8, 9} rks A  B Kkr dhft,A

mnkgj.k # 10 : lR; ;k vlR; dh foospuk dhft, :

mnkgj.k # 11 : osu vkjs[k dh lgk;rk ls fl) dhft, fd A – B = A  B.

osu vkjs[k ls ge fu"d"kZ fudky ldrs gS fd A – B = A  B.

leqPp; esa vo;oksa dh la[;k ij vk/kkfjr dqN egÙoiw.kZ ifj.kke

(ii) n(C – T) = n(T  C) – n(T) = 50 – 30 = 20

Øfer ;qXe (ORDERED PAIR) :

mnkgj.k # 16 : ekuk fd A = {2, 3, 4, 5, 6, 7, 8, 9}. ekukfd R, A ij ifjHkkf"kr ,d lEcU/k gS

vH;kl dk;Z iz'u :