Sets Relations and Functions Exercises
Sets Relations and Functions Exercises
29. f : R ® R is a function defined by f ( x ) = 10x - 7. If 39. Let f : R ® R, g : R ® R be two given functions, such
-1
g=f , then g ( x ) equals that f is injective and g is surjective, then which of the
1 1 x+7 x -7 following is injective?
(a) (b) (c) (d)
10 x - 7 10 x + 7 10 10 (a) gof (b) fog (c) gog (d) fof
Sets, Relations and Functions Exercise 2 :
More than One Correct Option Type Questions
n This section contains 3 multiple choice questions. (a) R1 = {( x, y ) : y = 2 + x, x Î X , y Î Y }
Each question has four choices (a), (b), (c) and (d) out of (b) R2 = {(1, 1 ), (2, 1 ), (3, 3 ), ( 4, 3 ), (5, 5 )}
which MORE THAN ONE may be correct. (c) R3 = {(1, 1 ), (1, 3 ), (3, 5 ), (3, 7 ), (5, 7 )}
40. Let L be the set of all straight lines in the Euclidean plane. (d) R4 = {(1, 3 ), (2, 5 ), (2, 4 ), (7, 9 )}
Two lines l 1 and l 2 are said to be related by the relation R 42. Let the function f : R - {-b } ® R - {1} be defined by
iff l 1 is parallel to l 2 . Then, the relation R is x +a
f (x ) = (a ¹ b ), then
(a) reflexive (b) symmetric x +b
(c) transitive (d) equivalence (a) f is one-one but not onto
41. Let X = {1, 2, 3, 4, 5, 6} andY = {1, 3, 5, 7, 9 }. Which of the (b) f is onto but not one-one
(c) f is both one-one and onto
following is/are relations from X to Y ? (d) f -1(2 ) = a - 2b
(C) sin x (r) one-one and onto R (D) f ( x ) = (sin x ) + (16 - x 2 ), then (s) [ -1, 3 ]
D f is
(D) 1 + ln x (s) one-one on ( 0, ¥ )
78. If A, B and C are three sets such that A Ç B = A Ç C and 83. Let R be the set of real numbers.
A È B = A È C , then [AIEEE 2009, 4M] Statement-1 A = {( x , y ) Î R ´ R : y - x is an integer} is
(a) A Ç B = f (b) A = B an equivalence relation on R.
(c) A = C (d) B = C Statement-2 B = {( x , y ) Î R ´ R : x = ay for some
79. Let S = {1, 2, 3, 4 }. The total number of unordered pair of rational number a} is an equivalence relation on R.
[AIEEE 2011, 4M]
disjoint subsets of S is equal to [IIT-JEE 2010, 5M]
(a) 25 (b) 34 (c) 42 (d) 41
(a) Statement-1 is true, Statement-2 is true; Statement-2 is 85. If X = {4 n - 3n - 1 : n Î N } andY = {9(n - 1): n = N }, where
not a correct explanation for Statement-1
N is the set of natural numbers, then X ÈY is equal to
(b) Statement-1 is true, Statement-2 is false
(c) Statement-1 is false, Statement-2 is true [JEE Main 2014, 4M]
(a) X (b) Y (c) N (d) Y - X
(d) Statement-1 is true, Statement-2 is true; Statement-2 is a
correct explanation for Statement-1 86. Let A and B be two sets containing four and two
84. Let A and B be two sets containing 2 elements and 4 elements, respectively. Then, the number of subsets of
elements, respectively. The number of subsets of A ´ B the set A ´ B, each having atleast three elements is
having 3 or more elements, is [JEE Main 2013, 4M] [JEE Main 2015, 4M]
(a) 220 (b) 219 (c) 211 (d) 256 (a) 275 (b) 510 (c) 219 (d) 256
Answers
62. X È Y = {(x, y) : x2 + y2 £ 1 or 0 £ x £ 1 and -1 £ y £ 1 }
X Ç Y = {(x, y) : x2 + y2 £ 1 and x ³ 0}
63. 5, 2, 12, 60 64. 43 65. 20 66. 45, 110
67. 44
70. (i) Not reflexive, symmetric, not transitive
(ii) Reflexive, symmetric, transitive
(iii) Reflexive, not symmetric, transitive
(iv) Reflexive, symmetric, not transitive
(v) Not reflexive, not symmetric, transitive
71. (i) Injective (ii) Injective
(iii) Bijective (iv) Not injective
(v) Surjective
Chapter Exerises 72. ( fog )x = e3x - 2 ; x Î R (gof )x = 3ex - 2; x Î R
1. (a) 2. (a) 3. (a) 4. (d) 5. (a) 6. (c) Domain of ( fog )-1 (x) = (0, ¥).
7. (b) 8. (c) 9. (b) 10. (d) 11. (c) 12. (b) Domain of (gof )-1 (x) = (-2, ¥).
13. (c) 14. (d) 15. (b) 16. (c) 17. (b) 18. (d) 3
19. (c) 20. (d) 21. (c) 22. (b) 23. (d) 24. (b) 73. , R - {1}
(1 - x)2
25. (d) 26. (b) 27. (b) 28. (a) 29. (c) 30. (b)
31. (b) 32. (d) 33. (c) 34. (d) 35. (a) 36. (d) df -1 (x) 3 df -1 (x)
= , Domain of = R - {1}
37. (c) 38. (d) 39. (d) 40. (a,b,c,d) 41. (a,b,c) dx (1 - x)2 dx
42. (c,d) 43. (b) 44. (a) 45. (d) 46. (a) 47. (b) ì 0 , x2 £ 0
48. (a) 49. (5) 50. (1) 51. (3) 52. (2) 53. (9) 74. (hofog ) x = í , h is not an identity function and fog is not
2 2
54. (A) ® (r); (B) ® (q); (C) ® ( p); (D) ® (s) îx , x ³ 0
55. (A) ® (s); (B) ® (r); (C) ® ( p); (D) ® (q) invertible.
56. (b) 57. (c) 58. (c) 59. (a) 75. (c) 76. (b) 77. (c) 78. (d) 79. (d) 80. (b)
60. (i) B (ii) C (iii) {2} (iv){x : x is an odd prime, natural number} 81. (d) 82. (a) 83. (a) 84. (b) 85. (b) 86. (c)
61. (i) S Ç W (ii) T ¢ Ç W ¢ (iii) ( M È T È S ) ¢
⇒ ( 2 − 1 ) is an irrational number.
⇒
( 2 − 1 ) is an irrational number.
(1, 3) ∈ R ⇒ (1 − 3 + 2 ) is an irrational number.
( 2 − 2 ) is an irrational number.
So, (1, 2) ∈ R and (2, 3) ∈ R ⇒
/ (1, 3) ∈ R (by any way)
1. By Venn diagram, ∴ R is not transitive relation.
6. f ( x ) = ( x + 1) 2 − 1 [Q x ≥ 1 ]
A B U
= x 2 + 1 + 2x − 1 = x 2 + 2x
S = { x : f ( x ) ≡ f −1( x )}
S is the set of point of intersection of (y = x ) and tf .
Now, solve y = x and f ( x ) = x 2 + 2 x
It is clear that A ∩ ( A ∪ B ) = A
x 2 + 2x = x
2. R S
A B B C x2 + x = 0
x( x + 1 ) = 0
x = 0 or x = − 1
R S 7. Let set A contains n elements.
A B C Power set of A is the set of all subsets.
∴ Number of subsets of A = nCo + nC1 + nC 2 + K + nCn = 2n
∴ Power set of A contains 2n elements.
8. By Venn diagram, it is clear that
SoR
A − B ⊆ A and B ′ − A′ ⊆ A and A ∩ B ′ ⊆ A
SoR is the relation from A to C.
but A ⊆ / A−B
3. R = {(1, 3), (2, 2), (3, 2)} 9. A = {1, 2, 3}
S = {(2, 1), (3, 2), (2, 3)}
S R
B = {3, 8 }
A ∪ B = {1, 2, 3, 8 }
1 1
2 3 A ∩ B = {3 }
3 2
3 2 ( A ∪ B ) × ( A ∩ B ) = {1, 2, 3, 8 } × {3 }
2 3
= {(1, 3 ), (2, 3 ), (3, 3 ) (8, 3 )}
10. A = { p, q, r }
RoS = {(2, 3), (2, 2), (3, 2)}
R1 = {( p, q ), (q, r ), ( p, r ), ( p, p )}
4. X ∩ (Y ∩ X )′ = X ∩ (Y ′∪ X ′ )
(q, q ) ∉ R1, so R1 is not reflexive relation.
= (X ∩ Y ′ ) ∪ (X ∩ X ′ ) So, R1 is not an equivalence relation.
= (X ∩ Y ′ ) ∪ φ = X ∩ Y ′
R2 = {(r , q ), (r , p ), (r , r ), (q, q )}
= X − (X ∩ Y )
Here, ( p, p ) ∉ R2, so R2 is not reflexive relation.
5. xRy ⇔ ( x − y + 2 ) is an irrational number. So, R2 is not an equivalence relation.
Let ( x, x ) ∈ R. R3 = {( p, p ), (q, q ), (r , r ), ( p, q )}
Then, x − x + 2 = 2 which is an irrational number. R3 is an reflexive relation.
∴ x R x, ∀ x ∈ R ( p, a ) ∈ R3 but (q, p ) ∉ R3
∴ R is an reflexive relation. R3 is not symmetric relation.
x R y ⇒ ( x − y + 2 ) is an irrational number. So, R3 is not equivalence relation.
⇒ − (y − x − 2 ) is an irrational number. 11 . A = {x : x is a multiple of 3}
A = {x : x = 3m, m ∈ N }
⇒ (y − x − 2 ) is an irrational number.
B = {x : x is a multiple of 5}
y R x ⇒ (y − x + 2 ) is an irrational number. B = { x : x = 5n, n ∈ N }
So, xRy ⇒yRx
/ ∴R is not a symmetric relation. A ∩ B = {x : x is a multiple of both 3 and 5}
Let (1, 2) ∈ R, then (1 − 2 + 2 ) is an irrational = {15, 30, 45, ...}
number.
12. A = {1, 2, 3}, B = {3, 4}, C = {4, 5, 6} 20.
n
means that n is a factor of m.
⇒ B ∩ C = { 4} m
and A ∪ ( B ∩ C ) = {1, 2, 3, 4 } So, f is reflexive.
Q A number is a factor of itself.
13. A = { x, y , z }, B = {u, v, w }
Now, if n is a factor of m, then m is not a factor of n
Now, f : A → B
∴ f is not symmetric. Let n is a factor of m and m is a factor of
A f B s, then it is true that n is a factor of s.
x u ∴ f is transitive.
8x − 6
y v 21. λ= , where λ ∈ I +
z w 14
14 λ + 6
∴ 8 x = 14 λ + 6 ⇒ x =
8
f is one-one and f is onto. 7λ + 3 3
⇒ x= = λ + ( λ + 1 ), when λ ∈ I
14. A = {2, 4 } 4 4
B = {3, 4, 5 } and here greatest common divisor of 8 and 14 is 2, so there are
A ∩ B = { 4} two required solutions.
A ∪ B = {2, 3, 4, 5 } for λ = 3 and λ = 7, x = 6, 13 or x = [6 ][13 ]
( A ∩ B ) × ( A ∪ B ) = {( 4, 2 ), ( 4, 3 ), ( 4, 4 ), ( 4, 5 )} 22. n( A ) = 10
15. X = {a, b, c, d } Total number of distinc Functions from A to A = 1010.
R1 = {(b, a ), (a, b ), (c, d ), (a, c )} 23. A ⊆ X and B ⊆ X and A ⊆ B
(a, b ) ∈ R1 and (a, c ) ∈ R, In all 3 possible cases,
∴R1 is not a function.
X X
R2 = {(a, d ), (d , c ), (b, b ), (c, c )} A B A B
X
a d
b b
c c
A X
d B
Hence, R2 is a function.
16. f : R → R
⇒ f ( x ) = sin x and g : R → R
24. A = {a, b, c, d }
⇒ g( x ) = x 2
B = {s , t, u }
Range of g is R + ∪ { 0 }, which is the subset of domain of f .
A B h
∴ Composition of fog is possible.
a a
fog = f ( g( x )) = f ( x 2 ) b
t
b
s
s t
= sin x 2 c c
u u
d d
17. x −1 = 0
2
⇒ x = − 1, 1
It is clear that f is a function.
∴ x is real, q x2 + 1 = 0
But in relation h, a have h image s and u.
⇒ x=±i
So, h is not a function.
∴ x is not real, x 2 − 9 = 0
25. f ( x ) = x 2, x ∈ Z
⇒ x=±3
f (1 ) = 1
∴ x is real x2 − x − 2 = 0 f ( −1 ) = 1
⇒ x = 2, − 1 ∴ f is not one-one
∴ x is real. Range of f is set of whole number.
18. By definition for equivalent relation. Which is a subset of Z.
R should be reflexive, symmetric, transitive. ∴f is not onto.
19. Q x - coordinates of two brackets are same. 26. It is obvious.
27. A = {1, 2, ...,n } n ≥ 2 32. f : A → B
B = {a, b } f is a function, then f −1 is also a bijective function.
Number of into functions from A to B = 2 Composite function ( f −1 of ) = I A
Total Numer of functions from A to B = [n( B )]n ( A ) = 2n A f B B f –1 A
∴ Total Number of onto functions from A to B = 2n − 2
28. f : R → R
⇒ f (x ) = 3x − 4
f is one-one onto function.
∴ Let y = 3x − 4 y y
33. f (y ) = , g(y ) =
y +4 (1 − y 2 ) (1 + y 2 )
x=
3 y
x+4 and ( fog )y = f ( g(y )) = f
Replace x by y ⇒ y = = f − 1( x ) (1 + y 2 )
3
y y
29. f : R → R
(1 + y 2 ) (1 + y 2 )
⇒ f ( x ) = 10 x − 7 = = =y
y2 1
It is clear that f is one-one and onto. 1−
(1 + y 2 ) (1 + y 2 )
∴ Let y = 10 x − 7
y +7 34. f : R → R
∴ x= = f −1(y )
10 f ( x ) = 2 x + | x|
x+7 When x ≥ 0, then f ( x ) = 2 x + x = 3 x
g( x ) = f −1( x ) =
10 When x < 0, then f ( x ) = 2 x − x = x
30. R = {(a, b ) : a ≥ b } Now, when x ≥ 0
f (3 x ) − f ( − x ) − 4 x = 3(3 x ) − ( − x ) − 4 x = 9 x + x − 4 x
We know that, a ≥ a
= 6x [Q x ≥ 0]
∴ (a, a ) ∈ R, ∀ a ∈ R
= 2(3 x ) = 2 f ( x ) [∴− x ≤ 0]
R is a reflexive relation.
When x < 0,
Let (a, b ) ∈ R f (3 x ) − f ( − x ) − 4 x = 3 x − ( −3 x ) − 4 x = 2 x = 2 f ( x )
⇒ a ≥b 35. Let A = {1, 2, 3}, R = {(1, 1) (1, 2)}
⇒
/ b ≤a and S = {(2, 2 ), (2, 3 )}
⇒
/ (b, a ) ∈ R be the transitive relation on A.
So, R is not symmetric relation. Then, R ∪ S = {(1, 1, ) (1, 2 )(2, 2 ) (2, 3 )}
Now, let (a, b ) ∈ R and (b, c ) ∈ R. R ∪ S is not transitive, because (1, 2 ) ∈ R ∪ S
⇒ a ≥ b and b ≥ c and (2, 3 ) ∈ R ∪ S but (1, 3 ) ∈ / R ∪ S.
⇒ a ≥c 36. f :R→ R
g:R→ R
⇒ (a, c ) ∈ R
f (x ) = 2x − 3
∴ R is a transitive relation.
g( x ) = x 3 + 5
31. A = {( x, y ) : y = e x , x ∈ R }
⇒ ( fog )( x ) = f ( g( x )) = f ( x 3 + 5 ) = 2( x 3 + 5 ) − 3
B = {( x, y ) : y = x, x ∈ R }
= 2x 3 + 7
Y
y = ex Now, let y = 2 x 3 + 7
2x 3 = y − 7
y=x 1/ 3
y − 7
x=
(0, 1) 2
Replacing x by y, we get
1/ 3
O x − 7
y =
2
1/ 3
∴ A⊂B x − 7
∴ ( fog ) −1( x ) =
2
37. f ( x ) = ax + b x1 + a x 2 + a
⇒ =
g( x ) = cx + d x1 + b x 2 + b
f ( g( x )) = g( f ( x )) ⇒ x1x 2 + bx1 + ax 2 + ab = x1x 2 + ax1 + bx 2 + ab
f (cx + d ) = g(ax + b ) ⇒ b( x1 − x 2 ) = a( x1 − x 2 )
a(cx + d ) + b = c(ax + b ) + d ⇒ ( x1 − x 2 ) (b − a ) = 0
acx + ad + b = acx + bc + d ⇒ x1 = x 2 [Qa ≠ b]
ad + b = cb + d ∴f is one-one function.
f (d ) = g(b ) x+a
Now, let y =
38. f : R → R, g : R → R x+b
f ( x ) = 2 min f ( x ) − g( x ),0 ) xy + by = x + a
Let f ( x ) − g( x ) > 0, then x(y − 1 ) = a − by
F ( x ) = f ( x ) − g( x ) − | f ( x ) − g( x )| andf ( x ) − g( x ) < 0, then a − by a − by
x= and f −1(y ) =
F ( x ) = 2 [ f ( x ) − g( x )] = [ f ( x ) − g( x )] − | f ( x ) − g( x )| y −1 y −1
39. f : R → R and g : R → R such that f is injective and + g is Q y ∈ R − {1 }
surjective. ∴ x is defined, ∀y ∈ R − {1 }
Then, g may be one-one or many-one. a − 2b
If g is one-one, then gof is one-one. f −1(2 ) = = a − 2b
2 −1
fog is one-one
gog is one-one Sol. (Q. Nos. 43 to 45)
But if g is many-one, then gof is not one-one. 43. ( gof )( 0) = g( f ( 0)) = g(7( 0) 2 + 0 − 8)
fog is not one-one. = g( −8 ) = | −8| = 8
gog is many-one and ( fog ) ( −3 ) = f ( g( −3 )) = f ( 0 ) = 7( 0 ) 2 + 0 − 8 = − 8
Now, fof is one-one ∴ ( gof )( 0 ) + ( fog ) ( −3 ) = − 8 + 8 = 0
40. Relation R on the set of all straight lines in the plane is of 44. ( fog )(7) = f ( g(7)) = f (7 2 + 4) = f (53)
parallel line.
= 8(53 ) + 3 = 427
A line is parallel to itself. So, R is reflexive. and ( gof )(6 ) = g( f (6 )) = g( 4 × 6 + 5 ) + g(29 )
If l1 is parallel to l 2 , then l 2 is parallel to l1. = (29 ) 2 + 4 = 845
∴ R is symmetric relation. [l1, l 2 ∈ L] ∴ 2( fog )(7 ) − ( gof )(6 ) = 2 × 427 − 845 = 9
Let l1, l 2, l 3 ∈ L 45. ( gof )(2) = g( f (2)) = g( 4 × 2 + 5) = g(13)
l1 is parallel to l 2 and l 2 is parallel to l 3. = (13 ) 2 + 4 = 173
Then, l1 is parallel to l 3.
and ( fog )( g ) = f ( g(9 )) = f (9 2 + 4 ) = f (85 )
∴ R is transitive relation.
= 8 × 85 + 3 = 683
So, R is equivalence relation.
∴ 4( gof )(2 ) − ( fog )(9 ) = 4 × 173 − 683 = 9
41. X = {1, 2, 3, 4, 5}
Sol. (Q. Nos. 46-48)
Y = {1, 3, 5, 7, 9 }
(a) R1 = {( x, y ) : y = 2 + x, x ∈ X , y ∈ Y }
46. We have, (a, b ) ∈ R1 iff | a − b| ≤ 7, where a, b ∈ z
x =1 y =2 Reflexivity Let a ∈ z
x =2 y =4 ⇒ a −a = 0
x =3 y =5 ⇒ | a − a| ≤ 7
x=4 y =6 ⇒ 0 ≤7
x =5 y =7
⇒ (a, a ) ∈ R1
So, R1 is a relation from X to Y .
∴The relation R1 is reflexive.
(b) R2 = {(1, 1 ), (2, 1 ), (3, 3 ) ( 4, 3 ), (5, 5 )} Symmetry
R2 ⊆ X × Y (a, b ) ∈ R1
(c) R3 = {(1, 1 ), (1, 3 ), (3, 5 ) (5, 7 )} ⇒ | a − b| ≤ 7 ⇒ | −(b − a )| ≤ 7
R3 ⊆ X × Y ⇒ | b − a| ≤ 7 ⇒ (b, a ) ∈ R1
(d) R4 ⊆
/ X ×Y ∴The relation R1 is symmetric.
42. f : R − { − b } → R − {1} Transitivity We have (2, 6), (6, 10 ) ∈ R1 because
x+a |2 − 6| = 4 ≤ 7 and |6 − 10| = 4 ≤ 7
f (x ) = [a ≠ b ]
x+b Also, |2 − 10| = 8 ≤/ 7
Let x1, x 2 ∈ D f ∴ (2, 10 ) ∈
/ R1
f ( x1 ) = f ( x 2 ) Hence, the relation R1 is not transitive.
47. We have (a, b ) ∈ R2 iff ab = 4, where a, b ∈ Q 50. ∴ cos x > −
1
and 0 ≤ x ≤ π
Reflexivity 5 ∈Q and (5 )(5 ) = 25 ≠ 4 2
∴ (5, 5 ) ∈ 2π 2π
/ R2 ⇒ − <x< and 0 ≤ x ≤ π
The relation R2 is not reflexive. 3 3
2π
Symmetry ⇒ 0≤x<
3
(a, b ) ∈ R2
2π
⇒ ab = 4 ⇒ ba = 4 ∴ A = 0,
3
⇒ (b, a ) ∈ R2
1 π
∴ The relation R2 is symmetric. Again, sin x > and ≤x≤π
2 3
1 1
Transitivity We have 8, , , 8 ∈ R2 because π 5π π
2 2 ⇒ <x< and ≤x≤π
6 6 3
1 1 π 5π
8 = 4 and (8 ) = 4
2 2 ⇒ ≤x<
3 6
Also, 8(8 ) = 64 ≠ 4 π 5π
∴ (8, 8 ) ∈ B= ,
/ R2 3 6
∴ The relation R2 is not transitive.
π 2π
A∩B=
3 3
48. We have, (a, b ) ∈ R3 iff a 2 − 4ab + 3b 2 = 0 Now, ,
where a, b ∈ R π 2π
Reflexivity ≤A∩B<
3 3
∴ a 2 − 4a ⋅ a + 3d 2 = 4a 2 − 4a 2 = 0 1 2
Here λ = and µ =
∴ (a, a ) ∈ R3 3 3
∴The relation R3 is reflexive. λ + µ =1
Symmetry 51. Here, A = [ −3, 7 ), B = ( 0, 10 )
(a, b ) ∈ R3
and S = ( − ∞, ∞ )
⇒ a 2 − 4ab + 3b 2 = 0, we get a = b and a = 3b
∴ A − B = [ −3, 0 ] and B − A = [7, 10 )
and (b, a ) ∈ R3 ∴ A∆B = ( A − B ) ∪ ( B − A ) = [ −3, 0 ] ∪ [7, 10 )
⇒ b 2 − 4ab + 3a 2 = 0
∴Positive integers are 7, 8, 9.
we get b = a and b = 3a Number of positive integers = 3
∴ (a, b ) ∈ R3 ⇒(
/ b, a ) ∈ R 3 52. As 2m − 2n = 48 = 16 × 3 = 2 4 × 3
∴The relation R3 is not symmetric.
⇒ 2n (2m − n − 1 ) = 2 4 (2 2 − 1 )
1
Transitivity We have (3, 1), 1, ∈ R3 ∴ n = 4 and m − n = 2
3
n = 4 and m = 6
because (3 ) 2 − 4(3 )(1 ) + 3(1 ) 2 = 9 − 12 + 3 = 0 Now, m −n =2
2
1 1 4 1 53. n(( A × B ) ∩ ( B × A )) = n(( A ∩ B ) × ( B ∩ A ))
and (1 ) 2 − 4(1 ) + 3 = 1 − + = 0
3 3 3 3 = n( A ∩ B ) ⋅ n( B ∩ A )
1 = n( A ∩ B ) ⋅ n ( A ∩ B )
Also, 3, ∉ R3, because
3 = 99 × 99 = 121 × 9 2
2
1 1 1 16 ∴ λ =9
(3 ) 2 − 4 ⋅ (3 ) + 3 = 9 − 4 + = ≠0
3 3 3 3 54. (A) y = 7x + 1
∴The relation R3 is not transitive. f (x ) = 7x + 1
49. Given, a = 22, Y
c = 12
H E (0,1)
a b c X′ X
O
Y′
and a + b + c = 45 Let x1, x 2 ∈ D f ,
⇒ 22 + b + 12 = 45 then f ( x1 ) = f ( x 2 )
∴ b = 11 = 2 λ + 1 ⇒ 7 x1 + 1 = 7 x 2 + 1 ⇒ x1 = x 2
⇒ λ =5 f is one-one, ∀ x ∈ R
y −1 ⇒ − sin x ≤ 4 sin x ≥ 0
Now, y = 7x + 1 ⇒ x =
7
⇒ sin x ≥ − 4 2nπ ≤ x ≤ (2n + 1 ) π , n ∈ z …(i)
for each y ∈ R, we get x ∈ R
f is onto function We know that sin x ∈ [ −1, 1 ]
(B) y = cos x ∴ x ∈R … (ii)
for x ∈[ 0, π ], y ∈ [ −1, 1 ] From Eqs. (i) and (ii); x ∈ [2kπ , (2k + 1 ) π ]
∴f is one-one on [0 π], Domain = ∪ [2kπ ,(2k + 1 π )]
k ∈I
∀ x ∈ R, y ∈ [ −1, 1 ]
y is not onto R.
(D) y = sin x + 16 − x 2 for y to be defined
(C) y = sin x or f ( x ) = sin x
for x ∈[ 0, π ], y ∈[ 0, 1 ] sin x ≥ 0 16 − x 2 ≥ 0
π 3 2π 3
x ∈ [2kπ ,(2k + 1 ) π ], k ∈ I −4 ≤ x ≤ 4 …(ii)
f = and f = …(i)
3 2 3 2
∴f is not one-one on ( 0, π ), From Eqs. (i) and (ii), we get
∀ x ∈ R and y ∈ [ −1, 1 ] x ∈ [ −4, − π ] ∪ [ 0, π ]
∴f is onto [ −1, 1 ]. 56. Let
(D) y = 1 + In x and f ( x ) = 1 + In x A = {a1, a 2, a 3, K , an }
2
y is defined for x ∈ ( 0, ∞ ) Then, the number of binary relations on A = n (n × n ) = nn
Let x1, x 2 ∈D f 2
and number of relations form A to A = 2n × n = 2n
then f ( x1 ) = f ( x 2 )
Both statements are true but Statement-2 is not a correct
⇒ 1 + In x1 = 1 + In x 2
explanation for Statement-1.
⇒ x1 = x 2
57. Let α ∈ ( A ∩ B ) ⇒α ∈ A and α ∈ B
∴ f is one-one, ∀ x ∈(0, ∞)
⇒ g(α ) = 0
3 − 2x
55. (A) Let y = 3 − x + sin −1 and f (α ) = 0
5
3 − 2x ⇒ { f (α )} 2 + { g(α )} 2 = 0
For y to be defined 3 − x ≥ 0 on −1 ≤ ≤1
5 ⇒ α is a root of { f ( x )} 2 + { g( x )} 2 = 0
x ≤3 …(i) Hence, Statement-1 is true and Statement-2 is false.
− 5 ≤ 3 − 2x ≤ 5
58. Let x ∈ P ( A ∩ B )
and −1 ≤ x ≤ 4 …(ii)
⇔ x ⊆ (A ∩ B )
From Eqs. (i) and (ii), we get
⇔ x ⊆ A and x ⊆ B
x ∈ [ −1, 3 ]
⇔ x ∈ P ( A ) and x ∈ P ( B )
(B) Let y = log10 {1 − log10( x 2 − 5 x + 16 )} for y to be defined
⇔ x ∈ P (A ) ∩ P (B )
x 2 − 5 x + 16 > 0 and 1 − log10( x 2 − 5 x + 16 ) > 0 ∴ P (A ∩ B ) ⊆ P (A ) ∩ P (B )
5
2
39 and P (A ) ∩ P (B ) ⊆ P (A ∩ B )
x − + > 0 and log10( x 2 − 5 x + 16 ) < 1
2 4 Hence, P (A ) ∩ P (B ) = P (A ∩ B )
which is true, ∀ x ∈R …(i) Now, consider sets A = {1 }, B = {2 } ⇒ A ∪ B = {1, 2 }
⇒ x 2 − 5 x + 16 < 10 ∴ P ( A ) = { φ, {1 }} , P ( B ) = { φ, {2 }}.
and P ( A ∪ B ) = { φ {1 }, {2 }, {1, 2 } ≠ P ( A ) ∪ P ( B )}
⇒ x 2 − 5 x + 6 < 0 ⇒ ( x − 3 )( x − 2 ) < 0
Hence, Statement-1 is true and Statement-2 is false.
⇒ 2 < x <3 …(ii)
59. n( A ∪ B ) = n( A ) + n( B ) − n( A ∩ B )
From Eqs. (i) and (ii), x ∈(2, 3 )
= 3 + 6 − n( A ∩ B ) = 9 − n( A ∩ B )
2
(C) Let y = cos−1 , for y to be defined As maximum number of element in ( A ∩ B ) = 3
2 + sin x ∴ Minimum number of elements in ( A ∩ B ) = 9 − 3 = 6
2 Q − 1 < sin x ≤ 1 Both statements are true; Statement-2 is a correct explanation
−1 ≤ ≤1 1 < 2 + sin x ≤ 3
2 + sin x for Statement-1.
Multiplying by (2 + sin x ) 60. A = { x : x is a natural number}
− (2 + sin x ) ≤ 2 ≤ 2 + sin x B = { x : x is an even natural number}
C = { x : x is an odd natural number}
⇒ −2 − sin x ≤ 2 2 ≤ 2 + sin x
D = { x : x is a prime number}
(i) A ∩ B = { x : x = 2n, n ∈ N } = B From Eq. (vi), d = 2
(ii) A ∩ C = { x : x is an odd natural number} = C From Eq. (iii) b + 2 + 3 + 5 = 22
(iii) B ∩ D = { x : x is prime natural number} = {2 } ∴ b = 12
(iv) C ∩ D = { x : x is odd prime natural number}
Hence, a = 20, b = 12, c = 11, d = 2, e = 7, f = 3, g = 5
61. U = Set of all people Number of children play all the three games = g = 5
M = {Males}
Number of children play cricket and hockey but not football
S = {College students} =d =2
T = {Teenagers}
Number of children play hockey only = b = 12
W = {People having height more than 5 feet}
Total number of children in the group
(i) College students having heights more than 5 feet = S ∩ W = a + b + c + d + e + f + g = 60
(ii) People who are not teenagers and having their heights
64. a + f + e + g = 21 …(i)
less than 5 feet = T ′ ∩ W ′
b + d + f + g = 26 …(ii)
(iii) All people who are neither males nor teenagers nor
college students = ( M ∪ T ∪ S )′ c + d + e + g = 29 …(iii)
62. X = {( x, y ) : x 2 + y 2 ≤ 1} f + g = 14 …(iv)
g + d = 15 …(v)
Y = {( x, y ) : 0 ≤ x ≤ 1, − 1 ≤ y ≤ 1 }
e + g = 12 …(vi)
X ∪ Y = {( x, y ) : x 2 + y 2 ≤ 1 or 0 ≤ x ≤ 1 and −1 ≤ y ≤ 1 }
g =8 …(vii)
X ∩ Y = {( x, y ) : x 2 + y 2 ≤ 1 and x ≥ 0}
Y Y B H
(0, 1)
(0, 1) a f b
g
e d
X´ X
(–1, 0) (1, 0) X´ X c
(1, 0)
(0, –1)
(0, –1) F
Y´
Y From Eqs. (vii) and (vi), e = 4
Y
Form Eqs. (vii) and (v), d = 7
(0, 1)
(0, 1) From Eqs. (vii) and (iv), f = 6
X´ X X´
O (1, 0)
X From Eq. (iii), c + 7 + 4 + 8 = 29 ⇒c = 29 − 19 = 10 = c
O (1, 0)
(0, –1) From Eq. (ii), b + 7 + 6 + 8 = 26 ⇒b = 26 − 21 ⇒ b = 5
(0, –1)
From Eq. (i), a + 6 + 4 + 8 = 21 ⇒a = 21 − 18 ⇒ a = 3
Y´ Y´ n( B ) + n( H ) + n( F ) = a + b + c + d + e + f + g
63. Given, a = 20 …(i) = 3 + 5 + 10 + 7 + 4 + 6 + 8 = 43
e + f + g = 15 …(ii) 65. a + e + f + g = 120 …(i)
b + d + f + g = 22 …(iii) b + d + f + g = 90 …(ii)
c = 11 …(iv) e + f + c + d = 70 …(iii)
F g + f = 40 …(iv)
f + d = 30 …(v)
a e + f = 50 …(vi)
e C
f g U=200
c M
P
d
b
a g b
H f
e d
c
c + d + e + g = 25 …(v)
⇒ d + e + g = 14 …(vi) C
e =7 …(vii)
f =3 …(viii) U − (a + b + c + d + e + f + g ) = 20
From Eqs. (vii), (viii) and (ix),
⇒ a + b + c + d + e + f + g = 180 …(vii)
e + g = 12 ...(ix)
From Eqs. (i) and (iv), a + e = 80 …(viii)
e = 7, f = 3, g = 5
From Eqs. (ii) and (iv), b + d = 50 …(ix)
From Eqs. (iii) and (v), e + c = 40 …(x) From (iv) and (vii), g + 11 = 15 ⇒ g = 4 …(viii)
from Eqs (viii), (ix) & (x), a + b + c + d + e + e = 197 …(xi) From (v) and (viii), f + 4 = 10 ⇒ f = 6 …(ix)
from (xi), (vii) and (iv), 197 − e + 40 = 180 From (i), c + 6 + 4 + 11 = 42 ⇒ c = 21 …(x)
170 − e + 40 = 180 From (ii), b + 4 + 4 + 11 = 36 ⇒ b = 17 …(xi)
e = 210 − 180 = 30 From (iii), a + 6 + 4 + 4 = 30 ⇒a = 16 …(xii)
From Eq. (vi), e + f = 50 Number of required persons
⇒ 30 + f = 50 = 123 − (16 + 17 + 21 + 4 + 11 + 6 + 4 )
⇒ f = 20 = 123 − 79
66. b + e + f + g = 205 …(i) = 44
∴ R is transitive relation.
(iv) aRb ⇔ 1 + ab > 0, ∀ a, b ∈ R
Reflexivity Let a ∉ R ⇒ 1 + a ⋅ a = 1 + a 2 > 0
–1
⇒ (a, a ) ∈ R O 1
∴ R is reflexive on R.
Symmetry Let (a, b ) ∈ R, then (a, b ) ∈ R
⇒ 1 + ab > 0 y =– x 2
⇒ 1 + ba > 0
⇒ (b, a ) ∈ R From figure, it is clear tat h is one-one and onto i.e.,
∴ R is symmetric on R. bijective.
(iv) k( x ) = x 2 1 + 2y
⇒ x=
1 −y
y = x2
Now, for y = 1, x is not defined.
1
1 Now, x = 0, f ( x ) = −
2
1
–1 1 ∴ R f = R − 1, −
2
Now, let x1, x 2 ∈ D f
k(1 ) = 1 x1 − 1 x 2 − 1
and k( −1 ) = 1 Then, f ( x1 ) = f ( x 2 ) ⇒ =
x1 + 2 x 2 + 2
So, k is many-one function.
⇒ x1x 2 + 2 x1 − x 2 − 2 = x1x 2 − x1 + 2 x 2 − 2
From figure, y ∈( 0, 1 )
⇒ x1 = x 2
∴ y is not onto function.
∴f is one-one function.
(v) y = l ( x ) = sin πx
x −1
for x = 1, l(1 ) = sin π = 0 Now, let y =
x+2
for x = − 1, l( −1 ) = sin( − π ) = 0
∴l is not one-one. 1 + 2y
Then, x=
Now, −1 ≤ x ≤ 1 1 −y
⇒ −π ≤ π x ≤ π −1 1 + 2y
⇒ f (y ) = [Q f ( x ) = y ⇒ x = f −1(y )]
⇒ −1 ≤ sin π x ≤ 1 1 −y
∴ y is onto function. 1 + 2x
Replace y by x, we get f −1( x ) =
Hence, l is surjective function. 1−x
72. ( fog ) x = f (3x − 2) = e 3x − 2 d −1 (1 − x ) 2 − (1 + 2 x ) ( −1 )
⇒ { f ( x )} =
and ( gof ) x = g(e x ) = 3e x − 2 dx (1 − x ) 2
( fog ) x = y ⇒ e 3x − 2 = y 2 − 2 x + 1 + 2x
Let =
2 + loge y (1 − x ) 2
⇒ 3 x − 2 = loge y ⇒ x = d 3
3 ⇒ { f −1 ( x )} =
2 + log y dx (1 − x ) 2
⇒ ( fog ) −1(y ) = e
3 d
∴ Domain of { f −1 ( x )} = R − {1 }
⇒ y > 0 So, domain of ( fog ) −1 is ( 0, ∞ ). dx
Now, again let ( gof ) x = 3e x − 2 74. f ( x ) = x 2 − 1
y +2 0, if x≤0
⇒ y = 3e x − 2 ⇒ e x = g( x ) = x 2 + 1; h( x ) =
3 x, if x≥0
y + 2 ∴ (hofog ) ( x ) = (hof ) { g( x )}
∴ x = loge
3
= (hof ) x 2 + 1
y + 2
⇒ ( gof ) −1(y ) = loge
3 = h { f (x 2 + 1) }
Clearly, y + 2 > 0 ⇒ y > −2 = h { (x 2 + 1)2 − 1} = h (x 2 + 1 − 1)
∴ Domain of ( gof ) −1 is ( −2, ∞ ).
= h (x 2 ) = x 2 [Q x 2 ≥ 0]
x2 − x
73. f (x ) = 2 …(i) and ( fog ) ( x ) = f { g( x )}
x + 2x 2
x( x − 1 ) = f ( x + 1 ) = x 2 + 1 − 1 = x 2 + 1 − 1 = x 2
2
f (x ) =
x( x + 2 )
Let y = ( fog ) x = x 2, ∀ x ∈ R
(x − 1)
f (x ) = ,x ≠0 …(ii) If x = 1, then y = 1
(x + 2)
If x = − 1, then y = 1
D f = { x : x 2 + 2x ≠ 0} [from Eq. (i)] 0 , x ≤ 0
So, fog is not one-one, so it is not invertible h( x ) =
= { x : x ∈ R − { 0, − 2 }} x , x ≥ 0
x −1 x = − 1, h ( −1 ) = 0 and for x = − 2, h( −2 ) = 0
Now, let y = For
x+2 ∴ h is not identity function.
⇒ yx + 2y = x − 1 ⇒ x(y − 1 ) = − (1 + 2y )
75. Here, (3, 3), (6, 6), (9, 9), (12, 12) So, it is Reflexive and (b) Symmetric xRy : ( x − y ) is an integer.
(3, 6 ), (6, 12 ), (3, 12 ) So, it is Transitive ⇒ − (y − x ) is also an integer.
Here, reflexive and transitive only. ∴ (y − x ) is also an integer.
76. Clearly, ( x, x ) ∈ R, ∀ x ∈W ⇒ y Rx
So, R is reflexive. Hence, it is symmetric.
Let ( x, y ) ∈ R, then (y , x ) ∈ R as x and y have atleast one letter (c) Transitive x R y and y R z
in common. So, R is symmetric. But R is not transitive. ⇒ ( x − y ) and (y − z ) are integere and.
e.g. Let x = INDIA, y = BOMBAY and z = JUHU ⇒ ( x − y ) + (y − z ) is an integer.
⇒ ( x − z ) is an integer.
Then, ( x, y ) ∈ R and (y , z ) ∈ R but ( x, z ) ∉ R
⇒ x Rz
77. T = {( x, y ) : x − y ∈ I }
∴ It is transitive
As 0 ∈ I , so T is a reflexive relation. Hence, it is equvalence relation.
If x − y ∈ I ⇒y − x ∈ I Statement-2
∴T is symmetric also. B = {( x, y ) ∈ R × R : x = αy for some reational number α}
If x − y = I and y − z = I 2
If α = 1, then
Then, x − z = ( x − y ) + (y − z ) = I 1 + I 2 ∈ I
xRy : x = y (To check equivalence)
∴ T is also transitive.
Hence, T is an equivalence relation. Clearly, x ≠ x + 1 ⇒ ( x , x ) ∉S (a) Reflexive xRx : x = x (True)
∴S is not reflexive. ∴Reflexive
78. Q A ∩ B = A ∩ C ⇒ B = C and A ∪ B = A ∪ C ⇒ B = C (b) Symmetric xRy : x = y ⇒ y = x ⇒ yRx
Hence, B =C ∴ Symmetric
79. For disoint sets, A ∩ B = φ (c) Transitive xRy and yRz ⇒ x = y
Each element in either A or B or neither. and y = z ⇒ x = z ⇒ xRz
∴ Transitive
∴ Total ways = 3 4 = 81; A = B iff A = B = φ
Hence, it is equivalence relation.
Otherwise, A and B are interchangable ∴Both are true but Statement-2 is not correct explanation of
∴ Number of unordered pair for disoint subsets of Statement-2
34 + 1 84. Q A × B has 8 elements.
S= = 41
2
∴Number of subsets = 2 8 = 256
80. xRy need not implies yRx. Number of subsets with zero element = 8C 0 = 1
m P m m
S : S ⇔ qm = pm ⇒ S is reflexive. Number of subsets with one element = 8C1 = 8
n q s n
m p p m Number of subsets with one elements = 8C 2 = 28
S ⇒ S is symmetric.
n q q n Hence, Number of subsets of A × B having 3 or more elements
m p p r = 256 − (1 + 8 + 28 ) = 256 − 37 = 219
and S , S ⇒qm = pn, pt = qr
n q q t 85. Since, 4n − 3n − 1 = (1 + 3)n − 3n − 1
⇒
m r
mt = nr ⇒ S is transitive. = (1 + nC1 ⋅ 3 + nC 2 ⋅ 3 2 + nC 3 ⋅ 3 3 + ... + nCn ⋅ 3n ) − 3n − 1
n t = 3 2(n C 2 + nC 3 ⋅ 3 + ...+ nCn ⋅ 3n − 2 )
∴ S is an equivalence relation.
⇒ 4n − 3n − 1 is a multiple of 9 for n ≥ 2
81. P : sin θ − cosθ = 2 cosθ ⇒ tanθ = 2 + 1
For n = 1, 4n − 3n − 1 = 4 − 3 − 1 = 0
1
Q : sin θ + cosθ = 2 sin θ ⇒ tanθ = = 2+1 For n = 2, 4n − 3n − 1 = 16 − 6 − 1 = 9
2 −1
∴4n − 3n − 1 is multiple of 9 for all n ∈ N .
∴ P =Q
It is clear that X contains elements, which are multiples of 9
82. Q( fogogof ) ( x ) = ( gogof ) ( x ) and Y contains all multiples of 9.
∴ (sinsin x 2 ) 2 = sinsin x 2 ⇒sinsin x 2 = 0 or 1 ∴ X ⊆ Y i.e., X ∪ Y = Y
⇒ x = + nπ , n ∈ { 0, 1, 2, 3,... } 86. n( A ) = 4, n( B ) = 2 ⇒ n( A × B ) = 8
83. Statement-1 A = {( x, y ) ∈ R × R : y − x is an integer} The number of subsets of A × B having at least three elements
= 8C 3 + 8C 4 + 8C 5 + ... + 8C 8
(a) Reflexive xRy : ( x − x ) is an integer
which is true. = 2 8 − ( 8C 0 + 8C1 + 8C 2 )
Hence it is reflexive. = 256 − (1 + 8 + 28 ) = 219