1

Day Sets, Relations

1 and Functions
A set is well defined class or collection of an object. Set is denoted by the symbol A, B, C, ... and its element is denoted by
a, b, c , etc.

Roster Method (Listing Method)

In this method a set is described by listing elements, separated by
commas, within braces Day 1 Outlines
e. g ., A set of vowels of English alphabet may be described as n
Types of Set
{ a, e, i, o, u}.
n
Power Set
Set Builder Method (Rule Method) n
Operation on Sets
In this method a set is described by a characterizing property P ( x) of n
Cartesian Product of Sets
its elements x. In such a case the set is described by { x : P ( x) holds} or n
Relation
{ x| P ( x) holds} which is read as the set of all x such that P ( x) holds.
The symbol | or : is read as such that
n
Function or Mapping
n
Different Kinds of Function
e. g ., The set P = {0, 1, 4 , 9, 16,...} can be written as P = { x2 | x Z }.
n
Composite Function
Types of Set
l The set which contains no element at all is called the null set
(empty set or void set) and it is denoted by the symbol or {} and,
if it contains single element in a set is called singleton set.
l A set in which the process of counting of elements is definitely comes
to an end, is called a finite set, otherwise it is an infinite set.
l Two sets A and B are said to be equal set iff every element of A is an
element of B and also every element of B is an element of A.
i. e., A = B, if x A x B.
But in equivalent set, they have the same number of elements, not
exactly the same elements.
l Two sets A and B are comparable, if one of them is a subset of the
other i. e., either A B or B A.
l A set that contains all sets in a given context is called universal set (U ).
l 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. If A is subset of B, we write A B.
l If A is a subset of B and A B, then A is a proper subset of B. i.e.,
A B.
l The null set is a subset of every set. Every set is a subset of itself
i.e., A and A A for every set A. They are called improper
subsets of A.
2 Master JEE Main Mathematics in Just 40 Days

Power Set (iii) Difference

If S is any set, then the family of all the subsets of S is called
the power set of S and it is denoted by P (S ). Power set of a
given set is always non-empty.
Venn Eulers Diagram
The combination of rectangles and circles are called
Venn Euler diagram or Venn-diagram.
Operation on Sets
(i) Union
Let A and B are two sets. The union of A and B is the
set of all elements which are in set A or in B.
i. e., A B = { x : x A or x B}.
(ii) Intersection
The intersection of A and B is the set of all those
elements that belongs to both A and B.
i.e., A B = { x : x A and x B}.
The difference of set A and set B i. e., A B , is the set of
all those elements of A which do not belong to B.
A B = { x : x A and x B}.
Similarly, B A = { x B : x A}.
(iv) Symmetric Difference
The symmetric difference of sets A and B is the set
( A B) ( B A) and is denoted by A B.
A B = ( A B) ( B A)
(v) Complement
Let U be the universal set and A be a set such that
A U . Then, complement of A with respect to U is
denoted by A or Ac or C ( A) or U A. It is defined as the
set of all those elements of U which are not in A.

Important Results on Number of Elements in Sets

1. n( A B) = n( A) + n(B) n( A B) 6. n (Number of elements in exactly two of the sets
2. n( A B) = n( A) + n(B) A and B are disjoint A, B and C)
non-void sets. = n( A B) + n(B C) + n(C A) 3n( A B C)
3. n( A B) = n( A) n( A B) 7. n (Number of elements in exactly one of the sets
A, B, C) = n( A) + n(B) + n(C) 2 n( A B)
4. n( A B) = n( A) + n(B) 2 n( A B) 2 n(B C) 2 n( A C) + 3 n( A B C)
5. n( A B C) = n( A) + n(B) + n(C) n( A B) 8. n( A B ) = n( A B) = n(U) n( A B)
n(B C) n( A C) + n( A B C) 9. n( A B ) = n( A B) = n(U) n( A B)

Laws of Algebra of Sets (v) (a) AB = A B

If A, B and C are any three sets, then (b) B A = B A
(i) Idempotent Laws (c) AB=AAB=
(a) A A = A (d) ( A B) B = A B
(b) A A = A (e) ( A B) B =
(ii) Identity Laws (f ) A B B A
(a) A = A (g) ( A B) ( B A) = ( A B) ( A B)
(b) A U = A (vi) (a) A ( B C ) = ( A B) ( A C )
(iii) Distributive Laws (b) A ( B C ) = ( A B) ( A C )
(a) A ( B C ) = ( A B) ( A C )
(b) A ( B C ) = ( A B) ( A C ) Cartesian Product of Sets
(iv) De-Morgans Laws Let A and B be any two non-empty sets. The set of all
(a) ( A B) = A B ordered pairs (a, b) such that a A and b B is called the
cartesian product of the sets A and B is denoted by A B.
(b) ( A B) = A B
(c) A ( B C ) = ( A B) ( A C ) Thus, A B = [( a, b) : a A and b B]
(d) A ( B C ) = ( A B) ( A C ) If A = or B = , then we define A B =
 Day
1 Sets, Relations and Functions 3
(b) it is symmetric i.e., ( a, b) R.
Relation
(b, a) R, a, b A
Let A and B be two non-empty sets, then relation R from A
(c) it is transitive i.e., ( a, b) R and (b, c) R.
to B is a subset of A B.
( a, c) R, a, b, c A
Let R A B and (a, b) R, then we say that a is related to
b by the relation R i.e., aRb. If ( a, b) R, then we write it as (vii) Inverse Relation
aRb.
Let A and B be two sets and R be a relation from a set A to
set B. Then, the inverse of R, denoted by R 1, is a relation
Domain and Range of a Relation from B to A and is defined by R 1 = {(b, a) : ( a, b) R}.
Let R be a relation from a set A to set B. Then, the set of all
Clearly, ( a, b) R (b, a) R 1.
first components or coordinates of the ordered pairs
belonging to R is called the domain of R while the set of all
second components or coordinates of the ordered pairs in R Composition of Relations
is called the range of R. Let R and S be two relations from set A to B and B to C
respectively, then we can define relation SoR from A to C
Thus, Dom ( R) = { a : ( a, b) R} such that ( a, c) SoR b B such that ( a, b) R and
Range ( R) = {b : ( a, b) R} (b, c) S .
This relation is called the composition of R and S .
Types of Relations
But RoS SoR
(i) Reflexive Relation Also, (SoR) 1 = R 1oS 1
A relation R on a set A is said to be reflexive, if every
element of A is related to itself.
Thus, R is reflexive ( a, a) R, a A.
Function or Mapping
If A and B are two non-empty sets, then a rule f which
(ii) Symmetric Relation associated to each x A, a unique number y B, is called a
function from A to B. i. e., f : A B.
A relation R on a set A is said to be symmetric relation iff
( a, b) R (b, a) R, a, b A. The set of A is called the domain of f ( D f ).
i.e., aRb bRa, a, b A The set of B is called the codomain of f (C f ).
The set consisting of all the images of the elements of the
or R is symmetric iff R 1 = R.
domain A( R f ).
(iii) Anti-Symmetric Relation
Let A be any set. A relation R on set A is said to be an Different Kinds of Function
anti-symmetric relation iff ( a, b) R and
(b, a) R a = b, a, b A. 1. One-One Function (Injection)
A function f : A B is said to be a one-one function or an
(iv) Transitive Relation injection, if different elements of A have different images in B.
Let A be any set A. A relation R on set A is said to be a Thus, f : A B is one-one, if there exist a, b A such that
transitive relation iff ( a, b) R and (b, c) R. a b f ( a) f (b), a, b A f ( a) = f (b).
( a, c) R, a, b, c A a = b, a, b A
i.e., aRb and bRc aRc, a, b, c A. A B

a1 b1
(v) Identity Relation f
a2 b2
Let A be a set. Then, the relation I A = {( a, a) : a A} on A is
a3 b3
called the identity relation on A.
a4 b4
(vi) Equivalence Relation
A relation R on a set A is said to be an equivalence relation
Graphically Any line parallel to x-axis cuts the graph of
on A iff
the function atmost at one point (in this case).
(a) it is reflexive i.e., ( a, a) R, a A.
4 Master JEE Main Mathematics in Just 40 Days

2. Many-One Function 4. Into Function A B

A function f : A B is said to be a A B A function f : A B is said to be an a1
f
b1
many-one function, if two or more a1 b1 into function, if there exists atleast
f a2 b2
elements of set A have the same a2 b2 one element in B having no
a3 b3
image in B. pre-image in A.
a3 b3 a4 b4
Thus, f : A B is a many-one i. e., f : A B is an into function, if it
a4 b4
function, if there exist a, b A such is not an onto function.
a5 b5
a5 b5
that a b but f ( a) = f (b). i. e.,
f : A B is a many-one function, if
it is not a one-one function.
5. One-One and Onto Function
Graphically Any line parallel to x-axis, cuts the graph of (Bijection)
the function atleast two points (in this case). A function f : A B is said to be a bijection, if it is one-one
as well as onto.
3. Onto Function (Surjection) f : A B is a bijection, if
A function f : A B is said to be an onto, if each element (i) it is one-one i.e., f ( x) = f ( y ) x = y , x, y A.
of B has its pre-image in A. (ii) it is onto i.e., y B, there exists x A such that
f ( x) = y .
If f 1( y ) A, y B. Then, function is onto.
Range of f = Codomain of f . Composite Function
A B
If f : A B and g : B C are two functions, then the
a1 f b1
composite function of f and g .
a2 b2
i. e., gof : A C will be defined as
a3 b3
gof ( x) = g [ f ( x)], x A.

dditional Points

=

=
=

 Day
1 Sets, Relation and Functions 5

G etting R ea dy
Day
1 Exercise
(Target JEE Main)
1. Which of the following is a singleton set? 9. If X = { 8n 7 n 1: n N} and Y = { 49 ( n 1) : n N}.
(a) { x :| x | = 5, x N} Then,
(b) { x :| x | = 6, x Z} (a) X Y (b) Y X
(c) { x : x 2 = 7, x N} (c) X = Y (d) None of these
(d) { x : x 2 + 2 x + 1 = 0, x N}
10. If P( A ) denotes the power set of A and A is the void set,
2. If x = {1, 2, 3, 4, 5, 6, 7, 8, 9}, A = { x N : 30 < x 2 < 70}, then what is number of elements in P{ P{ P{ P( A )}}}?
B = { x : x is a prime number less than 10}, then which of (a) 0 (b) 1
the following is incorrect? (c) 4 (d) 16
(a) A B = {2, 3, 5, 6, 7, 8} (b) A B = {7, 8} 11. Suppose that g ( x ) = 1 + x and f { g ( x )} = 3 + 2 x + x ,
(c) A B = { 6, 8} (d) A B = {2, 3, 5, 6, 8}
then f ( x ) is
3. Let X be the universal set for sets A and B, if (a) 1 + 2 x 2 (b) 2 + x 2
n( A ) = 200, n( B) = 300 and n( A B) = 100, then
(c) 1 + x (d) 2 + x
n( A B ) is equal to 300 provided n( X ) is equal to
(a) 600 (b) 700 (c) 800 (d) 900 12. Let f ( x ) = ax + b and g ( x ) = cx + d , a 0, c 0. Assume
4. In a town of 10000 families it was found that 40% family a = 1, b = 2 , if ( fog ) ( x ) = ( gof ) ( x ) for all x. What can you
buy newspaper A, 20% family buy newspaper B and say about c and d?
10% family buy newspaper C. 5% families buy A and B, (a) c and d both arbitrary (b) c = 1and d is arbitrary
3% families buy B and C and 4% families buy A and C. If (c) c is arbitrary and d = 1 (d) c = 1, d = 1
2% families buy all the three newspapers. Then, number cos 2 x + sin4 x
of families which buy A only is 13. If f ( x ) = for x R, then f(2002 ) is equal to
sin2 x + cos 4 x
(a) 3100 (b) 3300
(c) 2900 (d) 1400 (a) 1 (b) 2
(c) 3 (d) 4
5. Let A and B be two universal sets and A B C = U.
Then, {( A B) ( B C ) (C A )} is equal to 14. If there are three athelitic teams in a school, 21 are in the
basketball team, 26 in hockey team and 29 in the football
(a) A B C (b) A (B C )
(c) A B C (d) A (B C )
team. 14 play hockey and basketball, 15 play hockey
and football, 12 play football and basketball and 8 play
6. If two sets A and B are having 80 elements in common, all the games. The total number of members is
then the number of elements common to each of the sets (a) 42 (b) 43
A B and B A are (c) 45 (d) None of these
(a) 2 80 (b) 80 2
(c) 81 (d) 79 1 , x < 0

15. Let g( x) = 1 + x [ x ] and f ( x) = 0 , x = 0 ,
7. Let R is relation from (11, 12 , 13) to { 8 , 10 , 12} defined by
1, x > 0
y = x 3. Then, R 1
is
(a) {(8 , 11), (10 , 13)} (b) {(11, 18), (13 , 10 )} x, then f ( g ( x )) is equal to
(c) {(10 , 13), (8 , 11)} (d) None of these (a) x (b) 1
(c) f ( x ) (d) g( x )
8. Let L denotes the set of all straight lines in a plane and a
relation R be defined by R , , L. Then, R is 16. If f ( x ) = 2 [ x ] + cos x, then f : R R is
(a) reflexive (b) symmetric (a) one-one and onto (b) one-one and into
(c) transitive (d) None of these (c) many-one and into (d) many-one and onto
6 Master JEE Main Mathematics in Just 40 Days

Directions (Q. Nos. 17 to 19) Let A = {1, 2, 3, 4}, B = {1, 4, 9, 16}, 22. Statement I A relation is defined by
U = {1, 2, 3, 4, 9, 16} and R be a relation defined on A such that x 2, 0 x 3
R = {(1, 1), (2, 2 ), (3, 3), (1, 2 ), (2, 1), (3, 1), (1, 3)}. Also, define a f( x) = is a function.
2 x, 3 x 9
function f : A B is f ( x ) = x 2 .
Statement II In a function, every pre-image must have an
17. Find the set ( A B) U. unique image.
(a) {4} (b) {2, 3, 9, 16} 23. Statement I Let n be a fixed positive integer and a
(c) {1, 2, 3, 4, 9, 16} (d) None of these relation R be defined in I (the set of all integers) as
n
18. Function f is a follows : aRb iff , then a b is divisible by n. Then,
( a b)
(a) one-one (b) one-one-onto
(c) many- one (d) None of these relation is an equivalence.
Statement II If R and R are symmetric relation, then the
19. Relation R is a relation R R is not symmetric.
(a) reflexive (b) symmetric
(c) transitive (d) None of these 24. Two sets A and B are defined as follows
A = {( x, y ) : y = e 2 x, x R} and
Directions (Q. Nos. 20 to 23) Each of these questions contains
B = {( x, y ) : y = x 2, x R}, then
two statements : Statement I (Assertion) and Statement II
(Reason). Each of these questions also has four alternative (a) A B (b) B A (c) A B (d) A B =
choices, only one of which is the correct answer. You have to 25. Let f : R ~ { n} R be a function defined by
select one of the codes (a), (b), (c ) and (d ) given below. xm
f ( x) = , where m n . Then,
(a) Statement I is true, Statement II is true; Statement II is a xn
correct explanation for Statement I. (a) f is one-one-onto (b) f is one-one-into
(b) Statement I is true, Statement II is true; Statement II is not (c) f is many-one-onto (d) f is many-one-into
a correct explanation for Statement I. 1 + x 1 + x3
(c) Statement I is true; Statement II is false. 26. Let f ( x ) = and g ( x ) = , then fog ( x ) is equal
1 x 1 x3
(d) Statement I is false; Statement II is true.
to
20. Let R be a relation from set A = {1, 2 , 4} to set 1 1
(a) (b)
B = {1, 2 , 3 , 4 , 6 , 8} defined by x R y , if and only if x x2 x2
divides y, then 1 1
(c) 3 (d) 3
Statement I Domain and range of relation are respectively x x
the sets. x, if x is rational
Statement II All subsets of A and B are the domain and 27. f ( x ) = and
0, if x is irrational
range of the relation.
0, if x is rational
21. If f : R R and g : R R be two mappings such that g( x) = . Then, f g is
x, if x is irrational
Statement I f ( x ) = sin x and g( x ) = x 2 , then fog gof . (a) one-one and into (b) neither one-one nor onto
Statement II ( fog ) x = f ( x ) g( x ) = ( gof )x. (c) many-one and onto (d) one-one and onto

AIEEE Compendium
28. Let R be the set of real numbers. 29. Consider the following relations
Statement I A = {( x, y ) R R : y x is an integer} is an R = {( x , y ) | x and y are real numbers and x = wy for some
equivalence relation on R . rational number w};
m p
Statement II B = {( x, y ) R R : x = y for some rational S = , m, n , p and q are integers such that n, q 0
number } is an equivalence relation on R. (AIEEE 2011) n q
and qm = pn} . Then, (AIEEE 2010)
(a) Statement I is true, Statement II is true; Statement II is a
correct explanation for Statement I. (a) R is an equivalence relation but S is not an equivalence
relation.
(b) Statement I is true, Statement II is true; Statement II is not
(b) neither R nor S is an equivalence relation.
a correct explanation for Statement I.
(c) S is an equivalence relation but R is not an equivalence
(c) Statement I is true; Statement II is false. relation.
(d) Statement I is false; Statement II is true. (d) R and S both are equivalence relations.
 Day
1 Sets, Relations and Functions 7
30. If A, B and C are three sets such that A B = A C and 34. Let W denotes the words in the English dictionary. Define
A B = A C, then (AIEEE 2009) the relation R by R = {( x , y ) W W : the words x and y
(a) A = C (b) B = C (c) A B = (d) A = B have atleast one letter in common}. Then, R is
(AIEEE 2006)
31. For real x, let f ( x ) = x 3 + 5 x + 1, then (AIEEE 2009) (a) reflexive, symmetric and not transitive
(a) f is one-one but not onto R. (b) reflexive, symmetric and transitive
(b) f is onto R but not one-one. (c) reflexive, not symmetric and transitive
(c) f is one-one and onto R. (d) not reflexive, symmetric and transitive
(d) f is neither one-one nor onto R. 35. Let R = {( 3 , 3) ,(6, 6 ), ( 9, 9), (12 , 12 ), (6 , 12 ), ( 3 , 9),
32. Let f ( x ) = ( x + 1) 1, x 1
2
(AIEEE 2009) ( 3 , 12 ),( 3 , 6 )} be a relation on the set A = { 3 , 6 , 9 , 12}.
Statement I The set { x : f ( x ) = f 1 ( x )} = { 0, 1} The relation is (AIEEE 2005)
Statement II f is a bijection. (a) an equivalence relation
(a) Statement I is true, Statement II is true; Statement II is a (b) reflexive and symmetric
correct explanation for Statement I. (c) reflexive and transitive
(d) only reflexive
(b) Statement I is true, Statement II is true; Statement II is not
a correct explanation for Statement I. 36. Let R = {(1, 3), ( 4 , 2 ), (2 , 4), (2 , 3), ( 3 , 1)} be a relation on
(c) Statement I is true; Statement II is false. the set A = {1, 2 , 3 , 4}. The relation R is (AIEEE 2004)
(d) Statement I is false; Statement II is true. (a) reflexive (b) transitive
33. Let R be the real line. Consider the following subsets of (c) not symmetric (d) a function
the plane R R. 37. A function f from the set of natural numbers to integers
S = {( x, y ): y = x + 1and 0 < x < 2} defined by
and T = {( x, y ): x y is an integer} n 1
, when n is odd
Which one of the following is true?
(AIEEE 2008) f ( n) = 2 is
(a) T is an equivalence relation on R but S is not. n
, when n is even
(b) Neither S nor T is an equivalence relation on R. 2 (AIEEE 2003)
(c) Both S and T are equivalence relations on R. (a) one-one but not onto (b) onto but not one-one
(d) S is an equivalence relation on R but T is not. (c) one-one and onto both (d) neither one-one nor onto

Answers
1. (a) 2. (b) 3. (b) 4. (b) 5. (c) 6. (b) 7. (a) 8. (b) 9. (a) 10. (d)
11. (b) 12. (b) 13. (a) 14. (b) 15. (b) 16. (c) 17. (b) 18. (b) 19. (b) 20. (c)
21. (c) 22. (d) 23. (b) 24. (d) 25. (b) 26. (d) 27. (d) 28. (b) 29. (c) 30. (b)
31. (c) 32. (c) 33. (a) 34. (a) 35. (c) 36. (c) 37. (c)

Hints & Solutions

1. (a) Since, x N,| x | = 5 x = 5, it is a singleton set. A B = {7}
(b) Since, x Z,| x | = 6 x = 6, 6, it is not a singleton A B = { 6, 8}
set. A B = ( A B ) ( B A)
(c) x 2 = 7 x = 7 but x N. = { 6, 8} {2, 3, 5}
So, given set has no element. = {2, 3, 5, 6, 8}
(d) x + 2 x + 1 = 0
2
3. Q n( A B) = n( A) + n(B) n( A B)
( x + 1) = 0 x = 1, 1
2
n( A B) = 200 + 300 100 = 400
Since, 1 N n( A B ) = n( A B) = n( X ) n( A B)
So, given set has no element. 300 = n( X ) 400
2. Given, A = { x N : 30 < x < 70} = { 6, 7, 8}
2 n( X ) = 700
B = { x : x is a prime number less than 10} 4. Given, n( A) = 40% of 10000 = 4000
= {2, 3, 5, 7} n(B) = 20% of 10000 = 2000
A B = {2, 3, 5, 6, 7, 8} n (C ) = 10% of 10000 = 1000
8 Master JEE Main Mathematics in Just 40 Days

n ( A B) = 5% of 10000 = 500 11. Given, g( x ) = 1 + x and f { g( x )} = 3 + 2 x + x (i)

n (B C ) = 3% of 10000 = 300 f (1 + x)= 3 + 2 x + x
n(C A) = 4% of 10000 = 400 Put 1 + x = y x = ( y 1)2
n( A B C ) = 2% of 10000 = 200
f ( y ) = 3 + 2 ( y 1) + ( y 1)2 = 2 + y 2
n( A Bc Cc ) = n[ A (B C )c ]
f( x) = 2 + x2
= n( A) n[ A (B C )]
= n( A) n[( A B) ( A C )]
12. Now, ( fog ) ( x ) = f { g( x )} = a (cx + d ) + b
= n( A) [n ( A B) + n( A C ) and ( gof ) ( x ) = g{ f ( x )} = c (ax + b) + d
n( A B C )] Since, cx + d + 2 = cx + 2c + d (given)
= 4000 (500 + 400 200 ) Hence, c = 1and d is arbitrary.
= 4000 700 cos 2 x + sin 4 x
13. Given, f ( x ) =
= 3300 sin 2 x + cos 4 x
5. From Venn Eulers diagram, cos 2 x + sin 2 x (1 cos 2 x )
f( x) =
C U sin 2 x + cos 2 x (1 sin 2 x )
ABC sin 2 x + cos 2 x sin 2 x cos 2 x
CA f( x) =
sin 2 x + cos 2 x sin 2 x cos 2 x
f( x) = 1
AB BC f(2002 ) = 1
A 14. Given, n(B) = 21, n(H ) = 26, n(F ) = 29,
n(H B) = 14, n(H F ) = 15, n(F B) = 12,
It is clear that,
{( A B) (B C ) (C A)} = A B C n(B H F ) = 8
n(B H F ) = n(B) + n(H ) + n(F ) n(B H )
6. n( A B) (B A) = n( A B) (B A)
n(H F ) n(B F ) + n(B H F )
= n( A B) n(B A)
= 21 + 26 + 29 14 15 12 + 8
= n( A B) n( A B)
= 43
= 80 80 = 80 2
15. g( x ) = 1 + n n = 1 (put x = n Z)
7. R is a relation from {11, 12 , 13} to { 8, 10 , 12} defined by
and g( x ) = 1 + n + k n = 1 + k (put x = n + k)
y = x 3 x y = 3.
(where, n Z, 0 < k < 1)
R = {(11, 8), (13, 10 )}
1, g( x ) < 0
Hence, R 1 = {(8, 11), (10, 13)}
Now, f { g( x )} = 0, g( x ) = 0
8. Here, R 1, g( x ) > 0

Clearly, g( x ) > 0 , x
Hence, R is symmetric. So, f { g( x )} = 1, x
9. Since, 8n 7 n 1 = (7 + 1)n 7 n 1 16. Since, f ( x ) = 2 [ x ] + cos x
= 7 n + nC17 n 1 + nC2 7 n 2 + ... + nCn 17 + nCn 7 n 1 cos x, 0 x <1

= C2 7 + C3 7 + ... + Cn 7
n 2 n 3 n n
(Q C0 = Cn , C1 = Cn 1 )
n n n n = 2 + cos x, 1 x < 2
4 + cos x , 2 x < 3
= 49 [ C2 + nC3 (7 ) + ... + Cn 7
n n n2
]
Since, cos x < 1and 2 + cos x > 1.
Thus, 8 7 n 1 is a multiple of 49 for all n N.
n
f ( x ) never gives the value one.
X contains elements which one multiples of 49 and clearly Y
contains all multiples of 49. Hence, f ( x ) is into.
XY If 0 < < 3, then f ( ) = f ( + )
So, f ( x ) is not one-one.
10. The number of elements in power set of A is 1.
P{ P( A)} = 21 = 2 17. Now, A B = {1, 4}

P{ P{ P( A)}} = 2 2 = 4 ( A B) = { 2, 3, 9, 16}
( A B) U = { 2, 3, 9, 16}
P{ P{ P{ P( A)}}} = 2 4 = 16
 Day
1 Sets, Relations and Functions 9
18. f : A B, f ( x ) = x 2 24. Set A represents the set of points lying on the graph of an
exponential function and set B represent the set of points
Here, we see that for every element x of A,there exist a
lying on the graph of the polynomial.
image in B. So, it is one-one mapping . Also, for every
Take e 2 x = x 2 , then the two curves does not intersect.
element of B there exist a pre-image, so it is onto.
Hence, there is no point common between them.
Hence, f is one-one-onto.
25. For any x, y R, we have
19. A = {1, 2, 3, 4} xm ym
f ( x) = f ( y) = x= y
Here, we see that (4, 4) R, so it is reflexive. xn yn
Also, (1, 2 ) R (2 ,1) R So, f is one-one.
and (3, 1) R (1, 3) R Let R such that f ( x ) =
Hence, R is symmetric. xm m n
= x =
20. Given, R = {( x, y ) : x} Ry xn 1

x divides y, x A, y B} Clearly, x R for = 1

R = {(2 , 2 ), (2 , 4), (2 , 6), (2 , 8), (4, 4), (4, 8)} (i) So, f is not onto.
Domain of R = {2 , 4} 1+ x 1 + x3
26. f( x) = and g( x ) = , then
Now, there are 8 subsets of A but every subset of A is not the 1 x 1 x3
domain of relation defined in Eq. (i). 1 + x3
Again, range of relation = {2 , 4, 6, 8} 1+
1 x3 2 1
But there are 2 6 = 64 subsets of B but every subset of B is not fog( x ) = f { g( x )} = = = 3
1 + x3 2 x 3 x
the range of the relation defined in Eq. (i). 1
1 x3
21. Since, ( fog )x = f { g( x )} = f ( x 2 ) = sin x 2
x, x Q
and ( gof )x = g{ f ( x )} = g(sin x ) = sin 2 x 27. Let ( x ) = f ( x ) g( x ) =
x, x Q
fog gof Now, to check one-one
x 2, 0 x 3 Take any straight line parallel to x-axis which will intersect
22. Statement I f ( x ) =
2 x, 3 x 9 ( x ) only at one point.
Now, to check onto
Now, f(3) = 9
x, x Q
Also, f(3) = 2 3 = 6 Since, f ( x ) = y R
x, x Q
Here, we see that for one value of x, we get two different
values of f ( x ) . Hence, it is not a function but Statement II is 28. I. A = {( x , y ) R R : y x is an integer}
true. (a) Reflexive
23. (i) R is reflexive xRx : ( x x ) is an integer
Let a I, then a a = 0 i . e ., True
which is divisible by n. Reflexive
aRa , a I (b) Symmetric
(ii) R is symmetric xRy : ( x y ) is an integer
Let a, b I ( y x ) is an integer
a b = nk, k I ( y x ) is an integer yRx
(b a) = kn, where k I Symmetric
i.e., aRb = bRa (c) Transitive
(iii) R is transitive xRy and yRz
Now, aRb a b = k1 n and bRc ( x y ) is an integer and ( y z ) is an integer.
b c = k2 n, k1, k2 I Now, ( x y ) + ( y z ) is an integer
Now, a c = (a b) + (b c ) = k1 n + k2 n ( x z ) is an integer xRz
= (k1 + k2 )n Transitive Equivalence Relation
II. As R R are not disjoint, there is atleast one ordered II. B = {( x, y ) R R : x = y for some rational number }
pair, say (a, b) in R R but (a, b) R R (a, b) R If = 1, then
and (a, b) R. xRy : x = y (to check equivalence)
Since, R and R are symmetric. (a) Reflexive
Hence, R R is symmetric. xRx : x = x (True)
Hence, both statements are true but Statement II is not a Reflexive
correct explanation of Statement I.
10 Master JEE Main Mathematics in Just 40 Days

(b) Symmetric lim f ( x ) = and lim =

x x
xRy : x = y y = x yRx
Symmetric f ( x ) takes every value between and .
(c) Transitive Thus, f ( x ) is onto function.
xRy and yRz 32. Given, f ( x ) = ( x + 1)2 1, x 1
x = y andy = z x = z f ( x ) = 2( x + 1) 0 for x 1
xRz Equivalence f ( x ) is one-one.
Hence, both statements are true but Statement II is not a Since, codomian of the given function is not given, hence it
correct explanation of Statement I. can be considered as R, the set of reals and consequently R
29. Since, the relation R is defined as R = {( x , y ) | x , y are real is not onto.
numbers and x = wy for some rational number w}. Hence, f is not bijective. Statement II is false.
(i) Reflexive xRx x = wx Also, f ( x ) = ( x + 1)2 1 1 for x 1 Rf = [ 1, )
w = 1 Rational number Clearly, f ( x ) = f 1( x ) at x = 0 and x = 1
So, the relation R is reflexive. Hence, Statement I is true.
(ii) Symmetric xRy / yRx as 0 R1 0 (1)
33. Since, (1, 2) S but (2, 1) S
but 1R0 1 = w (0 )
S is not symmetric.
which is not true for any rational number.
Hence, S is not an equivalence relation.
So, the relation R is not symmetric.
Given, T = {( x, y ) : ( x y ) I}
Thus, R is not equivalence relation.
Now, x x = 0 I, it is reflexive relation.
Now, for the relation S is defined as
m p Again now, ( x y ) I
S = , m, n, p and q integers such that y x I, it is symmetric relation.
n q
Let x y = I1 and y z = I2 .
n , q 0 and qm = pn}
m m Now, x z = ( x y ) + ( y z ) = I1 + I2 I
(i) Reflexive R mn = mn (True)
n n T is also transitive.
Hence, the relation S is reflexive. Hence, T is an equivalence relation.
m p
(ii) Symmetric R mq = np 34. Let W = {CAT, TOY, YOU, ...}
n q
Clearly, R is reflexive and symmetric but not transitive.
p m
np = mq R (Since, CAT RTOY ,
/ CAT RYOU )
q n TOY RYOU

Hence, the relation S is symmetric. 35. Since, for every element of A, there exist a element
m p p r (3 , 3) ,(6, 6), (9, 9),(12 , 12 ) R R is reflexive relation.
(iii) Transitive R and R
n q q s Now, (6, 12 ) R but (12 , 6) R. So, it is not a symmetric
mq = np and ps = rq relation.
mq ps = np rq ms = nr Also, (3, 6), (6, 12 ) R (3 , 12 ) R R is transitive.

m r
=
m r
R 36. Since, (2 , 3) R but (3 , 2 ) R.
n s n s So, R is not symmetric.
So, the relation S is transitive.
37. Let x, y N and both are even.
Hence, the relation S is equivalence relation.
x y
30. Since, A B = A C and A B = A C B = C Then, f ( x) = f ( y) = x=y
2 2
31. Given, f ( x ) = x 3 + 5 x + 1 Again, x, y N and both are odd. Then,
Now, f ( x ) = 3 x 2 + 5 > 0, x R f ( x) = f ( y) x = y
f ( x ) is strictly increasing function. Since, each negative integer is an image of even natural
number and positive integer is an image of odd natural
Hence, f ( x ) is one-one function.
number.
Clearly, f ( x ) is a continuous function and also increasing on
R.