6 40 ONE

21 Let f : N → N defined by f ( x ) = x 2 + x + 1 , x ∈ N, then f is (c) S is an equivalence relation but R is not an equivalence

(a) one-one onto (b) many-one onto relation
(c) one-one but not onto (d) None of these (d) R and S both are equivalence relations
22 Let R be the real line. Consider the following subsets of 2 + x , x ≥ 0
24 If f ( x ) =  , then f (f ( x )) is given by
the plane R × R . 4 − x , x < 0
S = {( x , y ): y = x + 1and 0 < x < 2}  4 + x, x≥0  4 + x, x ≥ 0
(a) f (f (x)) =  (b) f (f (x)) = 
and T = {( x , y ): x − y is an integer}  6 − x, x<0  x, x<0
 4 − x, x≥0  4 − 2 x, x ≥ 0
Which one of the following is true? (c) f (f (x)) =  (d) f (f (x)) = 
 x, x<0  4 + 2 x, x < 0
(a) T is an equivalence relation on R but S is not
(b) Neither S nor T is an equivalence relation on R 25 Statement I A relation is defined by
(c) Both S and T are equivalence relations on R  x 2, 0 ≤ x ≤ 3
(d) S is an equivalence relation on R but T is not f (x ) =  is a function.
23 Consider the following relations 2 x , 3 ≤ x ≤ 9
R = {(x , y) | x and y are real numbers and x = wy for some Statement II In a function, every member must have a
rational number w}; unique image.
 m p 
S =  ,  m, n , p and q are integers such that n, q ≠ 0 (a) Statement I is true, Statement II is true; Statement II is a
 n q  correct explanation for Statement I
and qm = pn }. Then, (b) Statement I is true, Statement II is true; Statement II is
(a) R is an equivalence relation but S is not an equivalence not a correct explanation for Statement I
relation (c) Statement I is true; Statement II is false
(b) neither R nor S is an equivalence relation (d) Statement I is false; Statement II is true

DAY PRACTICE SESSION 2

PROGRESSIVE QUESTIONS EXERCISE

 1 6 On the set N of all natural numbers define the relation R
1 If f ( x ) + 2f   = 3x , x ≠ 0 and S = {x ∈ R : f ( x ) = f ( − x )};
x by aRb iff the g.c.d. of a and b is 2, then R is
then S j
JEE Mains 2016 (a) reflexive but not symmetric (b) symmetric only
(a) is an empty set (c) reflexive and transitive (d) equivalence relation
(b) contains exactly one element 7 Suppose f is a function satisfying f ( x + f ( x )) = 4f ( x ) and
(c) contains exactly two elements f (1) = 4. The value of f ( 21) is
(d) contains more than two elements
(a) 16 (b) 64 (c) 4 (d) 44
 2x − 1 
2 x ∈ R : 3 ∈R  is equal to  1 1
x + 4x + 3x
2 8 Let f  x +  = x 2 + 2 , x ≠ 0, then f ( x ) is equal to
   x  x
(a) R − {0} (b) R − {0, 1, 3 } (a) x 2 (b) x 2 − 1
(d) R − 0, − 1, − 3, 
1 (c) x 2 − 2 (d) x 2 + 1
(c) R − {0, − 1, − 3 }
 2 x
9 Let f ( x ) = , the fofofo K of ( x ) is
3 Given the relation R = {(1, 2) ( 2, 3)} on the set A = {1, 2, 3}, 1+ x2 1442443
x times
the minimum number of ordered pairs which when
x x
added to R make it an equivalence relation is (a) (b)
 n   n 
(a) 5 (b) 7 (c) 6 (d) 8 1+  Σ r  x2 1 +  Σ 1 x 2
r = 1  r = 1 
4 The set ( A ∪ B ∪ C ) ∩ ( A ∩ B ′∩ C ′ )′ ∩ C ′ is equal to  
x
x nx
j
NCERT Exemplar (c)   (d)
 1+ x2  1 + nx 2
(a) B ∩ C ′ (b) A ∩ C  
(c) B ′∩ C ′ (d) None of these 10 If two sets A and B are having 99 elements in common,
5 Let A = {1, 2, 3, 4}, B = {2, 4, 6}. Then the number of sets then the number of elements common to each of the sets
C such that A ∩ B ⊆ C ⊆ A ∪ B is A × B and B × A are
(a) 6 (b) 9 (c) 8 (d) 10 (a) 2 99 (b) 992 (c) 100 (d) 18
DAY 7

ANSWERS
SESSION 1 1. (b) 2. (d) 3. (d) 4. (b) 5. (c) 6. (c) 7. (b) 8. (d) 9. (a) 10. (c)
11. (a) 12. (b) 13. (b) 14. (a) 15. (a) 16. (a) 17. (b) 18. (a) 19. (b) 20. (c)
21. (c) 22. (a) 23. (c) 24. (a) 25. (d)

SESSION 2 1. (c) 2. (c) 3. (b) 4. (a) 5. (c) 6. (b) 7. (b) 8. (c) 9. (b) 10. (b)

Hints and Explanations

SESSION 1 6 From Venn Euler’s diagram, 11 Qa2 − 4 a ⋅ a + 3 a2 = 4 a2 − 4 a2 = 0
1 Clearly, 1 ≠ 0, 2 and 2 [Q y ∈ N ] ∴ (a, a) ∈ R, ∀a ∈ N ⇒ R is reflexive.
C U
y 3 Now, as a2 − 4 ab + 3b 2 = 0
A∩B∩C
1 C–A but b 2 − 4ba + 3 a2 ≠ 0
∴ can be 1.
y
∴ R is not symmetric.
⇒ x = 1 ∈Q Also, (a, b ) ∈ R and (b, c ) ∈ R
A–B B–C ⇒/ (a, c ) ∈ N
2 The number of elements in power set of B
A is 1. So, R is not transitive.
A
∴ P {P ( A )} = 2 = 2
1
12 Given, g ( x ) = 1 + x
⇒ P {P {P ( A )}} = 22 = 4 It is clear that,
{( A − B ) ∪ (B − C ) ∪ (C − A )} ′ and f { g ( x )} = 3 + 2 x + x …(i)
⇒ P {P {P {P ( A )}}} = 24 = 16 = A ∩ B ∩C ⇒ f (1 + x) = 3 + 2 x + x
3 We have, 7 Qn ( A ∪ B ) = n ( A ) + n (B ) − n ( A ∩ B ) Put 1 + x = y ⇒ x = ( y − 1)2
X = {4n − 3 n − 1: n ∈ N } ∴ n ( A ∪ B ) = 200 + 300 − 100 = 400 ∴ f ( y ) = 3 + 2 ( y − 1) + ( y − 1)2
∴ n ( A ′ ∩ B ′ ) = n ( A ∪ B )′ = n ( X ) = 2 + y2
X = {0, 9, 54, 243,...}
[put n = 1,2,3,...] − n( A ∪ B ) ∴ f ( x ) = 2 + x2
Y = {9(n − 1): n ∈ N } ⇒ 300 = n ( X ) − 400
⇒ n ( X ) = 700
13 Here, ( fog )( x ) = f {g ( x )} = a(cx + d ) + b
Y = {0, 9,18,27,...} and (gof ) ( x ) = g { f ( x )} = c (ax + b ) + d
[put n = 1,2,3,...] 8 We know, Since, cx + d + 2 = cx + 2c + d
It is clear that X ⊂ Y . n ( A ∪ B ) = n( A ) + n(B ) − n( A ∩ B )
[Q a = 1, b = 2]
∴ X ∪Y = Y ∴ P = 1500 − n ( A ∩ B )
⇒ n( A ∩ B ) = 1500 − P Hence, c = 1 and d is arbitrary.
4 Clearly, A ∩ B = A ∩ C and Clearly, 1 ≤ n( A ∩ B ) ≤ 500
A ∪ B = A ∪ C possible if 14 R is a relation from {11, 12, 13} to
[Qmaximum number of elements
B =C common in A and B = 500] {8, 10, 12} defined by
y =x−3⇒ x− y =3
⇒ 1 ≤ 1500 − P ≤ 500
5 Number of elements in ∴ R = {(11, 8), (13, 10)}
A 1 ∪ A 2 ∪ A 3 ∪…∪ A 30 is 30 × 5 but ⇒ − 1499 ≤ − P ≤ − 1000
⇒ 1000 ≤ P ≤ 1499 Hence, R −1 = {( 8, 11), (10, 13)}
each element is used 10 times, so
30 × 5 9 We know, 15 Clearly, R −1 = {(5, 4), (4, 1), (6, 4), (6, 7),
n(S ) = = 15 …(i)
10 n ( A × B × C ) = n ( A ) × n(B ) × n(C ) (7, 3)}
Similarly, number of elements in ∴ n(C ) =
24
=2 Now, as (4, 5) ∈ R and (5, 4) ∈ R −1 ,
4×3 therefore (4, 4) ∈ R −1OR
B1 ∪ B2 ... ∪ B n is 3 n but each element
is repeated 9 times, so 10 Since for each a ∈ A, (a, a)∈ R. R is Similarly, (1, 4) ∈ R and (4, 1) ∈ R −1
3n reflexive relation. ⇒ (1, 1) ∈ R −1OR
n(S ) =
9 (4, 6) ∈ R and (6, 7) ∈ R −1
Now, (6, 12) ∈ R but (12, 6) ∉ R. So, it is
3n not a symmetric relation. ⇒ (4, 7) ∈ R −1OR
⇒ 15 = [from Eq. (i)]
9 (7, 6) ∈ R and (6, 7) ∈ R −1
Also, (3, 6), (6, 12) ∈ R ⇒ (3, 12) ∈ R
⇒ n = 45 ⇒ (7, 7) ∈ R −1OR
⇒ R is transitive.
(7, 6) ∈ R and (6, 4) ∈ R −1
8 40 ONE

⇒ (7, 4) ∈ R −1OR integer is an image of odd natural ⇒ mq ⋅ ps = np ⋅ rq ⇒ ms = nr

and (3, 7) ∈ R and (7, 3) ∈ R −1 number. So, f is onto.
⇒
m r
=
⇒ (3, 3) ∈ R −1OR 21 Let x, y ∈ N such that f ( x ) = f ( y ) n s
m r
Hence, R −1OR = {(1, 1), (4, 4), (4, 7), ⇒ x2 + x + 1 = y 2 + y + 1 ⇒ S
n s
(7, 7), (7, 4), (3, 3)} ⇒ ( x2 − y 2 ) = y − x So, the relation S is transitive.
16 Let x, y ∈ A such that f ( x ) = f ( y ), then ⇒ ( x − y ) ( x + y + 1) = 0 Hence, the relation S is
f ( f ( x )) = f ( f ( y )) ⇒ x = y or x = − y − 1 ∉ N equivalence relation.
⇒ x= y ⇒ x= y 24 Clearly,
⇒ f is one-one. ⇒ f is one-one. 2 + f ( x ), f ( x) ≥ 0
Also,for any a∈ A, we have But f is not onto, as 1∈N does not have f ( f ( x )) = 
 4 − f ( x ), f ( x) < 0
f ( f (a)) = a any pre-image.
2 + (2 + x ), x ≥ 0
⇒ f (b ) = a , where b = f (a) ∈ A ∴ f is one-one but not onto. = 
Thus, for each a ∈ A (codomain) there 2 + (4 − x ), x < 0
exists b = f (a) ∈ A such that f (b ) = a 22 Since, (1, 2) ∈ S but (2, 1) ∉S 4 + x, x ≥ 0
= 
∴ f is onto. Thus S is not symmetric.
 6 − x, x < 0
Hence f is a bijective function. Hence, S is not an equivalence relation.
 2
 x + 59 
Given, T = {( x, y ) : ( x − y )∈ I } 25 Statement I f ( x ) =  x , 0 ≤ x ≤ 3
17 We have, 3 f ( x ) + 2 f   Now, x − x = 0∈ I , it is reflexive 2 x, 3 ≤ x ≤ 9
 x− 1 
relation. Now, f (3) = 9
= 10 x + 30 … (i) Again, now ( x − y )∈ I
x + 59 Also, f (3) = 2 × 3 = 6
On replacing x by , we get ⇒ y − x ∈ I , it is symmetric relation. Here, we see that for one value of x,
x−1
Let x − y = I1 there are two different values of f ( x ).
 x + 59 
3f   + 2 f ( x) and y − z = I2 Hence, it is not a function but
 x−1  Then, x − z = ( x − y ) + ( y − z) Statement II is true.
40 x + 560
= …(ii) = I1 + I2 ∈ I
x−1 So, T is also transitive. Hence, T is an SESSION 2
On solving Eqs. (i) and (ii), we get equivalence relation. 1 We have, f ( x ) + 2 f  1  = 3 x,
6 x − 4 x − 242
2  x
f ( x) = 23 Since, the relation R is defined as
x−1 R = {( x , y )| x , y are real numbers and x ≠ 0 … (i)
f   + 2 f ( x ) =
6 × 49 − 4 × 7 − 242 x = wy for some rational number w}. 1 3
∴ f (7) = =4 ∴ … (ii)
6 (a) Reflexive xRx as x = 1 x  x x

replacing x by 
Here, w = 1 ∈ Rational number 1
18 We know that if n( A ) = n and n(B ) = 2, 
So, the relation R is reflexive.  x 
the number of onto relations from A to
B = 2n − 2 (b) Symmetric xRy ⇒
/ yRx as 0R1 but On multiplying Eq. (ii) by 2 and then
subtracting it from Eq. (i), we get
∴ Required number of relations 1 R/ 0
6
So, the relation R is not − 3 f ( x) = 3 x −
= 2100 − 2 x
symmetric. 2
19 Suppose for any x, y ∈ R, Thus, R is not equivalence ⇒ f ( x) = − x
x
f ( x) = f ( y ) relation. Now, consider f ( x ) = f (− x )
x−m y −m
⇒ = Now, for the relation S, defined as,
2 2 4
x−n y −n  m p  ⇒ − x=− + x ⇒ = 2x
⇒ x= y S =   ,  m , n, p and q ∈ integers x x x
So, f is one-one.  n q 
Let α ∈ R be such that f ( x ) = α such that n , q ≠ 0 and qm = pn} ⇒ x2 = 2 ⇒ x = ± 2
x−m m − nα m m
∴ =α ⇒ x= (a) Reflexive S ⇒ mn = mn Thus, x contains exactly two elements.
x−n 1−α n n 2x −1
[true] 2 Clearly, 3 ∈ R only when
Clearly, x ∉ R for α = 1 Hence, the relation S is reflexive. x + 4 x2 + 3 x
So, f is not onto. m p x3 + 4 x2 + 3 x ≠ 0
(b) Symmetric S ⇒ mq = np
20 Let x, y ∈ N and both be even. n q Consider x3 + 4 x2 + 3 x = 0
x y p m
Then, f ( x ) = f ( y ) ⇒ − = − ⇒ np = mq ⇒ S ⇒ x ( x2 + 4 x + 3) = 0
2 2 q n
⇒ x=y ⇒ x ( x + 1) ( x + 3) = 0
Again, x, y ∈ N and both are odd. Hence, the relation S is ⇒ x = 0, − 1, − 3
Then, f ( x ) = f ( y ) ⇒ x = y symmetric.  2x − 1 
∴ x ∈ R : 3 ∈ R
So, f is one-one
m p
(c) Transitive S and
p r
S  x + 4 x2
+ 3 x 
n q q s = R − {0, − 1, − 3}
Since, each negative integer is an image
of even natural number and positive ⇒ mq = np and ps = rq
DAY 9

3. For R to be an equivalence relation, R Thus, aRb ⇒ bRa x

must be reflexive, symmetric and Hence, R is symmetric. 1 + x2
transitive. According to given option, R is =
x2
R will be reflexive if it contains (1, 1), symmetric only. 1+
(2, 2) and (3, 3) 1 + x2
7 We have, x
R will be symmetric if it contains =
f ( x + f ( x )) = 4 f ( x ) and f (1) = 4
(2, 1) and (3, 2) 1 + 2 x2
On putting x = 1, we get
R will be transitive if it contains (1, 3) x
and (3, 1) f (1 + f (1)) = 4 f (1) Similarly, f ( f ( f ( x ))) =
Hence, minimum number of ordered ⇒ f (1 + f (1)) = 16 1 + 3 x2
pairs = 7 ⇒ f (1 + 4) = 16 M M
x
4 ( A ∪ B ∪ C ) ∩ ( A ∩ B ′∩ C ′ )′∩ C ′ ⇒ f (5) = 16 fofo K of of ( x ) =
1442443 1 + nx2
= ( A ∪ B ∪ C ) ∩ ( A ′∪ B ∪ C ) ∩ C ′ On putting, x = 5, we get n times
= (φ ∪ B ∪ C ) ∩ C ′ f (5 + f (5)) = 4 f (5) x
=
= (B ∪ C ) ∩ C ′ ⇒ f (5 + 16) = 4 × 16  n 
= (B ∩ C ′ ) ∪ φ = B ∩ C ′ 1 +  Σ 1 x2
⇒ f (21) = 64 r =1 
5 Here, A ∩ B = {2, 4}
8 We have, 10 We know,
and A ∪ B = {1, 2, 3, 4, 6}
( A × B ) ∩ (C × D ) = ( A ∩ C )
f  x +  = x2 + 2
1 1
Q A ∩ B ⊆ C ⊆ A∪B
 x x × (B ∩ D )
∴ C can be {2, 4}, {1, 2, 4}, {3, 2, 4},
2 ∴ ( A × B ) ∩ (B × A ) = ( A ∩ B )
=  x +  − 2
{6, 2, 4}, {1, 6, 2, 4}, {6, 3, 2, 4}, 1
× (B ∩ A )
{1, 3, 2, 4}, {1, 2, 3, 4, 6}  x
Thus, number of elements common to
Thus, number of set C which satisfy the ⇒ f ( x ) = x2 − 2 A × B and B × A
given condition is 8.
x = n (( A × B ) ∩ (B × A ))
6 Clearly, g.c.d (a, a) = a, ∀ a ∈ N 9 We have, f ( x ) =
1 + x2 = n (( A ∩ B ) × (B ∩ A ))
∴R is not reflexive. = n( A ∩ B ) × n (B ∩ A )
f ( x)
If g.c.d (a, b ) = 2, then g.c.d (b, a) is ⇒ f ( f ( x )) = = 99 × 99 = 992
also 2. 1 + ( f ( x ))2