Function
Function
Relations and
Functions
Numerical
Q.1 The number of 4-digit numbers which are neither multiple of 7 nor multiple of 3
is ____________.
31st Aug Evening Shift 2021
Q.2
Q.6 If f(x) and g(x) are two polynomials such that the polynomial P(x) = f(x3) + x
g(x3) is divisible by x2 + x + 1, then P(1) is equal to ___________.
18th Mar Evening Shift 2021
Q.7
Q.8
1. Ans. (5143)
2. Ans. (256)
3. Ans. (490)
4. Ans. (832)
5. Ans. (720)
6. Ans. (0)
7. Ans. (2)
8. Ans. (5)
Numerical Explanation
Ans. 1 A = 4-digit numbers divisible by 3
⇒ n = 1286
⇒ n = 429
Q.2 Let f : N → N be a function such that f(m + n) = f(m) + f(n) for every m, n∈N. If
f(6) = 18, then f(2) . f(3) is equal to :
Q.4 Which of the following is not correct for relation R on the set of real numbers ?
Q.5
Q.7 Out of all patients in a hospital 89% are found to be suffering from heart ailment
and 98% are suffering from lungs infection. If K% of them are suffering from both
ailments, then K can not belong to the set :
Q.11
27th Jul Evening Shift 2021
g(3n + 1) = 3n + 2,
g(3n + 2) = 3n + 3,
Q.13
22th Jul Evening Shift 2021
Q.15
Q.16
20th Jul Evening Shift 2021
Q.17
Q.18
18th Mar Evening Shift 2021
Q.19
Q.20
Q.22 In a school, there are three types of games to be played. Some of the students
play two types of games, but none play all the three games. Which Venn diagrams
can justify the above statement?
Q.23
17th Mar Morning Shift 2021
Q.24 Let A = {2, 3, 4, 5, ....., 30} and '≃' be an equivalence relation on A × A, defined
by (a, b) ≃ (c, d), if and only if ad = bc. Then the number of ordered pairs which
satisfy this equivalence relation with ordered pair (4, 3) is equal to :
Q.27 Let [ x ] denote greatest integer less than or equal to x. If for n∈N,
Q.29
Q.30 Let R = {(P, Q) | P and Q are at the same distance from the origin} be a relation,
then the equivalence class of (1, −1) is the set :
26th Feb Morning Shift 2021
Q.31 Let x denote the total number of one-one functions from a set A with 3
elements to a set B with 5 elements and y denote the total number of one-one
functions form the set A to the set A × B. Then :
Q.32
Q.34
1. Ans. (D)
2. Ans. (B)
3. Ans. (C)
4. Ans. (B)
5. Ans. (D)
6. Ans. (A)
7. Ans. (C)
8. Ans. (C)
9. Ans. (B)
10. Ans. (B)
11. Ans. (C)
12. Ans. (A)
13. Ans. (A)
14. Ans. (C)
15. Ans. (D)
16. Ans. (B)
17. Ans. (C)
18. Ans. (B)
19. Ans. (C)
20. Ans. (B)
21. Ans. (A)
22. Ans. (B)
23. Ans. (B)
24. Ans. (D)
25. Ans. (A)
26. Ans. (C)
27. Ans. (D)
28. Ans. (B)
29. Ans. (B)
30. Ans. (B)
31. Ans. (C)
32. Ans. (A)
33. Ans. (A)
34. Ans. (A)
MCQ Explanation
Ans 1.
Ans 2.
Ans 3.
Ans 4. Note that (a, b) and (b, c) satisfy 0 < |x − y| ≤ 1 but (a, c) does not satisfy it so
0 ≤ |x − y| ≤ 1 is symmetric but not transitive.
For example,
0 ≤ |x – y| = 0.7 ≤ 1
0 ≤ |y – z| = 0.6 ≤ 1
But |x – z| = 1.3 > 1
So, (b) is correct.
Ans 5.
Ans 9.
Ans 10.
Ans 11.
Ans 12.
Ans 13.
Ans 14.
Ans 15.
Ans 16.
Ans 17. For domain,
Ans 18. Finding inverse of f(x)
Ans 19.
Ans 20.
Ans 21.
Ans 22. As none play all three games the intersection of all three circles must be
zero.
Ans 25.
Ans 26.
Ans 27.
Ans 28.
Ans 29.
f(1) = 2
f(2) = 2
f(3) = 4
f(4) = 4
f(5) = 6
f(6) = 6
f(7) = 8
f(8) = 8
f(9) = 10
f(10) = 10
∴ f(1) = f(2) = 2
f(3) = f(4) = 4
f(5) = f(6) = 6
f(7) = f(8) = 8
f(9) = f(10) = 10
∴ x = 1, 2, g(2) = 2
Similarly, at x = 3, 4, g(4) = 4
at x = 5, 6, g(6) = 6
at x = 7, 8, g(8) = 8
at x = 9, 10, g(10) = 10
Here, you can see for even terms mapping is fixed. But far odd terms 1, 3, 5, 7, 9 we
can map to any one of the 10 elements.
Ans 30. Given R = {(P, Q) | P and Q are at the same distance from the origin}.
Then equivalence class of (1, −1) will contain al such points which lies on
circumference of the circle of centre at origin and passing through point (1, −1).
Ans 31. Number of elements in A = 3
Number of elements in B = 5
Number of elements in A × B = 15
x=5×4×3
x = 60
Ans 34.
∵ Any horizontal line does not cut the graph at more than one points, so it is one-one
and here, co-domain and range are not equal, so it is into.
10. Let P be the relation defined on the set of all real numbers 17. Consider the following relations:
such that R = {(x, y) | x, y are real numbers and x = wy for some
P = {(a, b) : sec2a – tan2b = 1}. Then P is: æ m pö
[Online April 9, 2014] rational number w}; S = {ç , ÷ | m,n, p and q are
è n qø
(a) reflexive and symmetric but not transitive.
integers such that n, q ¹ 0 and qm = pn}.
(b) reflexive and transitive but not symmetric.
Then [2010]
(c) symmetric and transitive but not reflexive.
(a) Neither R nor S is an equivalence relation
(d) an equivalence relation.
(b) S is an equivalence relation but R is not an equivalence
11. Let R = {(x, y) : x, y Î N and x2 – 4xy + 3y2 = 0}, where N relation
is the set of all natural numbers. Then the relation R is : (c) R and S both are equivalence relations
[Online April 23, 2013] (d) R is an equivalence relation but S is not an equivalence
(a) reflexive but neither symmetric nor transitive. relation
(b) symmetric and transitive. 18. Let R be the real line. Consider the following subsets of
(c) reflexive and symmetric, the plane R × R:
(d) reflexive and transitive. S ={(x, y): y = x + 1 and 0 < x < 2}
12. Let R = {(3, 3) (5, 5), (9, 9), (12, 12), (5, 12), (3, 9), (3, 12), (3, 5)} T ={(x, y): x – y is an integer},
be a relation on the set A = {3, 5, 9, 12}. Then, R is : Which one of the following is true? [2008]
[Online April 22, 2013] (a) Neither S nor T is an equivalence relation on R
(a) reflexive, symmetric but not transitive. (b) Both S and T are equivalence relation on R
(b) symmetric, transitive but not reflexive. (c) S is an equivalence relation on R but T is not
(c) an equivalence relation. (d) T is an equivalence relation on R but S is not
(d) reflexive, transitive but not symmetric. 19. Let W denote the words in the English dictionary. Define
the relation R by R = {(x, y) Î W × W| the words x and y
13. Let A = {1, 2, 3, 4} and R : A ® A be the relation defined have at least one letter in common.} Then R is [2006]
by R = {(l, 1), (2, 3), (3, 4), (4, 2)}. The correct statement is : (a) not reflexive, symmetric and transitive
[Online April 9, 2013] (b) relexive, symmetric and not transitive
(a) R does not have an inverse. (c) reflexive, symmetric and transitive
(b) R is not a one to one function. (d) reflexive, not symmetric and transitive
(c) R is an onto function. 20. Let R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9),
(d) R is not a function. (3, 12), (3, 6)} be a relation on the set
14. If P(S) denotes the set of all subsets of a given set S, then A = {3, 6, 9, 12}. The relation is [2005]
the number of one-to-one functions from the set (a) reflexive and transitive only
S = {1, 2, 3} to the set P(S) is [Online May 19, 2012] (b) reflexive only
(a) 24 (b) 8 (c) 336 (d) 320 (c) an equivalence relation
(d) reflexive and symmetric only
15. If A = {x Î z + : x < 10 and x is a multiple of 3 or 4}, where
21. Let f : (– 1, 1) ® B, be a function defined by
z+ is the set of positive integers, then the total number of
symmetric relations on A is [Online May 12, 2012] -1 2x
f (x) = tan , then f is both one - one and onto when
(a) 25 (b) 215 (c) 210 (d) 220 1 - x2
16. Let R be the set of real numbers. [2011] B is the interval [2005]
Statement-1: A = {(x, y) Î R × R : y – x is an integer} is an æ pö é pö
equivalence relation on R. (a) ç 0, ÷ (b) ê0, ÷
è 2ø ë 2ø
Statement-2: B = {(x, y) Î R × R : x = ay for some rational
number a} is an equivalence relation on R. æ p pö
(c) éê- p , p ùú (d) ç - , ÷
(a) Statement-1 is true, Statement-2 is true; Statement-2 is ë 2 2û è 2 2ø
not a correct explanation for Statement-1. 22. Let R = {(1,3), (4, 2), (2, 4), (2, 3), (3,1)} be a relation on the
(b) Statement-1 is true, Statement-2 is false.
set A = {1, 2,3, 4}. . The relation R is [2004]
(c) Statement-1 is false, Statement-2 is true.
(d) Statement-1 is true, Statement-2 is true; Statement-2 is (a) reflexive (b) transitive
a correct explanation for Statement-1. (c) not symmetric (d) a function
Relations and Functions M-253
34. Let f (x) = 210·x + 1 and g(x) = 310·x – 1. If (fog)(x)=x, then 38. Let f be a function defined by
x is equal to : [Online April 8, 2017]
f ( x) = ( x -1) +1, ( x ³1) .
2
[2011RS]
310 - 1 210 - 1
{ }
(a) (b)
310 - 2 -10 210 - 3-10 Statement - 1 : The set x : f ( x ) = f ( x ) = {1, 2} .
-1
-10 -10
1- 3 1- 2 Statement - 2 : f is a biection and
(c) (d)
210 - 3-10 310 - 2 -10
f -1 ( x ) = 1 + x - 1, x ³ 1.
1
35. For x Î R, x ¹ 0 , let f0(x) = and fn+1 (x) = f0(fn(x)), (a) Statement-1 is true, Statement-2 is true; Statement-2 is
1- x a correct explanation for Statement-1.
æ 2ö æ 3ö (b) Statement-1 is true, Statement-2 is true; Statement-2 is
n = 0, 1, 2, .... Then the value of f100(3) + f1 çè ÷ø + f 2 çè ÷ø is NOT a correct explanation for Statement-1.
3 2
equal to : [Online April 9, 2016] (c) Statement-1 is true, Statement-2 is false.
8 4 5 1 (d) Statement-1 is false, Statement-2 is true.
(a) (b) (c) (d)
3 3 3 3 39. Let f(x) = ( x + 1)2 –1, x ³ –1
1
36. If g is the inverse of a function f and f ' ( x ) = , then Statement -1 : The set {x : f(x) = f –1(x) = {0, –1}
1+ x 5
Statement-2 : f is a biection. [2009]
g ¢ ( x ) is equal to: [2014] (a) Statement-1 is true, Statement-2 is true. Statement-2 is
not a correct explanation for Statement-1.
1
(b) 1 + { g ( x )}
5 (b) Statement-1 is true, Statement-2 is false.
(a)
1 + { g ( x )}
5
(c) Statement-1 is false, Statement-2 is true.
(c) 1 + x5 (d) 5x4 (d) Statement-1 is true, Statement-2 is true. Statement-2 is
37. Let A and B be non empty sets in R and f : A ® B is a a correct explanation for Statement-1.
biective function. [Online May 26, 2012] 40. Let f: N®Y be a function defined as f(x) = 4x + 3 where
Statement 1: f is an onto function. Y = {y Î N : y = 4x + 3 for some x Î N}.
Statement 2: There exists a function g : B ® A such that Show that f is invertible and its inverse is [2008]
fog = IB.
3y + 4 y+3
(a) Statement 1 is true, Statement 2 is false. (a) g ( y ) = (b) g ( y ) = 4 +
(b) Statement 1 is true, Statement 2 is true; Statement 2 is 3 4
a correct explanation for Statement 1. y+3 y –3
(c) Statement 1 is false, Statement 2 is true. (c) g ( y ) = (d) g ( y ) =
4 4
(d) Statement 1 is true, Statement 2 is true, Statement 2 is
not the correct explanation for Statement 1.
Relations and Functions M-255
1. (19.00)
ì1, n =1
The desired functions will contain either one element or ï1, n=2
two elements in its codomain of which '2' always belongs ï
to f (A). ï 2, n=3
\ The set B can be {2}, {1, 2}, {2, 3}, {2, 4} ï
ï 2, n=4
Total number of functions = 1 + (23 – 2)3 = 19. ï
í3, n=5
2. (Bonus) f : (0, ) ® (0, ) ï3, n=6
f(g(n)) = ï
1 ï: :
f (x) = 1 – is not a function ï: :
x ï
ïî: :
Q f (1) = 0 and 1 Î domain but 0 Ï co-domain
Þ fog is onto but not one - one
Hence, f (x) is not a function.
5. (d) As A = {x Î R : x is not a positive integer}
3. (c) Domain and codomain = {1, 2, 3, ¼, 20}.
2x
There are five multiple of 4 as 4, 8, 12, 16 and 20. A function f : A ® R given by f(x) =
x -1
and there are 6 multiple of 3 as 3, 6, 9, 12, 15, 18. f(x1) = f(x2) Û x1 = x2
Since, when ever k is multiple of 4 then f(k) is multiple of 3 So, f is one-one.
then total number of arrangement As f(x) ¹ 2 for any x Î A Þ f is not onto.
Hence f is inective but not surective.
= 6c5 × 5! = 6!
é 1 1ù
Remaining 15 elements can be arranged in 15! ways. 6. (d) We have f : R ® ê - , ú ,
ë 2 2û
Since, for every input, there is an output
x
Þ function f (k) in onto f (x) = "x Î R
1 + x2
\ Total number of arrangement = 15! . 6!
(1 + x 2 ).1 - x.2x -(x + 1)(x - 1)
Þ f ¢(x) = 2 2
=
ì n +1 (1 + x ) (1 + x 2 ) 2
ïï 2 , if n is odd – + –
4. (a) f(n) = íï n
, if n is even
ïî 2 x = –1 x=1
sign of f ¢ (x)
Þ f ¢ (x) changes sign in different intervals.
ì 2, n = 1 \ Not inective
ï1, n = 2
ï x
ï 4, n = 3 Now y =
í 1 + x2
g(n) = ï3, n = 4 Þ y + yx2 = x
ï6, n = 5
ï Þ yx2 – x + y = 0
î5, n = 6 For y ¹ 0, D = 1 – 4y2 ³ 0
Then, é -1 1 ù
Þ y Î ê , ú - {0}
ë 2 2û
ì g ( n) + 1
ïï 2 , if g ( n) is odd For y = 0 Þ x = 0
f(g(n)) = íï g (n) é -1 1 ù
, if g ( n) is even \ Range is ê , ú
ïî 2 ë 2 2û
Þ Surective but not inective
EBD_8344
M-256 Mathematics
In part–C, only reverse of the order pairs of part –B are So, S is not reflexive.
present i.e., if (a, b) is present in part – B, then (b, a) will be Hence, S in not an equivalence relation.
present in part –C Given T ={x, y): x – y is an integer}
For example (3, 4) is present in part – B and (4, 3) present in Q x – x = 0 is an integer, " x Î R
part –C. So, T is reflexive.
Number of order pair in A, B and C are 5, 10 and 10 Let (x, y) Î T Þ x – y is an integer then
respectively. y – x is also an integer Þ (y, x) Î R
In any symmetric relation on set A, if any order pair of part \T is symmetric
–B is present then its reverse order pair of
If x – y is an integer and y – z is an integer then
part –C will must be also present.
(x – y) + (y– z) = x – z is also an integer.
Hence number of symmetric relation on set A is equal to
\ T is transitive
the number of all relations on a set D, which contains all
Hence T is an equivalence relation.
the order pairs of part –A and part– B.
Now n(D) = n(A) + n(B) = 5 + 10 = 15 19. (b) Clearly ( x, x) Î R, "x ÎW
Hence number of all relations on set D = (2)15 Q All letter are common in some word. So R is reflexive.
Þ Number of symmetric relations on set D = (2)15 Let ( x, y ) Î R , then ( y , x) Î R as x and y have at least one
16. (a) Q x – x = 0 Î I (\ R is reflexive) letter in common. So, R is symmetric.
Let (x, y) Î R as x – y and y – x Î I (Q R is symmetric) But R is not transitive for example
Now x – y Î I and y – z Î I Þ x – z Î I Let x = BOY, y = TOY and z = THREE
So, R is transative.
then ( x, y ) Î R (O, Y are common) and (y, z) Î R (T is
Hence R is equivalence.
common) but (x, z) Ï R. (as no letter is common)
Similarly as x = ay for a = 1. B is reflexive symmetric and
20. (a) R is reflexive and transitive only.
transative. Hence B is equivalence.
Here (3, 3), (6, 6), (9, 9), (12, 12) Î R [So, reflexive]
Both relations are equivalence but not the correct
explanation. (3, 6), (6, 12), (3, 12) Î R [So, transitive].
17. (b) Let x R y. Q (3, 6) Î R but (6, 3) Ï R [So, non-symmetric]
x æ 2x ö
Þx = wy Þy= 21. (d) Given f (x) = tan -1 ç = 2tan–1x
w è 1 - x 2 ÷ø
Þ (y, x) Ï R
R is not symmetric for x Î (-1, 1)
m p æ -p p ö
Let S : S If x Î( -1, 1) Þ tan -1 x Î ç
è 4 4 ÷ø
,
n q
p m
Þ qm = pn Þ =
æ -p p ö
q n Þ 2 tan -1 x Î ç
è 2 2 ÷ø
,
m m
Q = \ reflexive.
n n æ p pö
Clearly, range of f (x) = ç - , ÷
m p p m è 2 2ø
= Þ q = n \ symmetric
n q
For f to be onto, codomain = range
m p p r
Let S , S æ p pö
n q q s \ Co-domain of function = B = ç - , ÷ .
è 2 2ø
Þ qm = pn, ps = rq
22. (c) Q (1, 1) Ï R Þ R is not reflexive
p m r
Þ = = Q (2, 3) Î R but (3, 2) Ï R
q n s \ R is not symmetric
Þ ms = rn transitive. Q (4, 2) and (2, 4) Î R but (4, 4) Ï R
S is an equivalence relation. Þ R is not transitive
18. (d) Given that
23. (a) Given that f ( x) is onto
S = {(x , y) : y = x + 1 and 0 < x < 2}
Q x ¹ x + 1 for any x Î(0, 2) \ range of f (x) = codomain = S
Þ (x, x) Ï S
EBD_8344
M-258 Mathematics
x -1 y - 1 æ5ö
f ( x) = f ( y) Þ
1
= Þx=y tç ÷ =-
2 2 è ø
4 2
\ f (n) is one-one for odd natural number.
Hence f is one-one. æ a - xö
a-ç
è a + x ÷ø
n –1 27. (d) f ( f ( x )) = =x
Let y = Þ 2 y +1 = n æ a - xö
a+ç
è a + x ÷ø
2
This shows that n is always odd number for y Î I.
..........(i) a - ax a(1 - x ) a - x
Þ = f ( x) Þ = Þ a =1
–n 1+ x 1+ x a+ x
and y = Þ –2 y = n
2 1- x æ 1ö
This shows that n is always even number for y Î I. \ f ( x) = Þ f ç- ÷ = 3
1+ x è 2ø
..........(ii)
28. (b) Q f (x) = (( hof ) og)(x)
From (i) and (ii)
Range of f = I = codomain æpö æ æ æ p öö ö
\ f is onto. Q f ç 3 ÷ = h ç f ç g ç 3 ÷ ÷ ÷ = h( f ( 3)) = h(31/4 )
è ø è è è øøø
Hence f is one one and onto both.
1- 3 1
= = - (1 + 3 - 2 3) = 3 - 2 = -(- 3 + 2)
82 x - 8-2 x 1+ 3 2
25. (a) y = 2x
8 + 8-2 x
æ pö 11p
= – tan 15 = tan (180 – 15 ) = tan ç p - ÷ = tan
1+ y 8 2x 1+ y è 12 ø 12
= Þ 84 x =
1 - y 8-2 x 1- y 29. (c) f (x) = x2 ; x Î R
g (A) = {x Î R : f (x) Î A} S = [0, 4]
æ1+ y ö g (S) = {x Î R : f (x) Î S}
Þ 4 x = log8 ç ÷
è1- y ø = {x Î R : 0 £ x2 £ 4} = {x Î R : – 2 £ x £ 2}
\ g (S) ¹ S \ f (g (S)) ¹ f (S)
1 æ 1+ y ö g (f (S)) = {x Î R : f (x) Î f (S)}
Þ x = log 8 ç ÷
4 è1- y ø = {x Î R : x2 Î S2} = {x Î R : 0 £ x2 £ 16}
= {x Î R : – 4 £ x £ 4}
1 æ1+ x ö
\ f -1( x) = log8 ç ÷ \ g (f (S)) ¹ g (S)
4 è 1- x ø
\ g (f (S)) = g (S) is incorrect.
Relations and Functions M-259
30. (a) The given relation is Now, for R2 , (b, a) Î R2, (a, c) Î R2 but (b, c) Ï R2.
1 Similarly, for R1 , (b, c) Î R1, (c, a) Î R1 but (b, a) Ï R1.
(f2o Jo f1) (x) = f3(x) = Therefore, neither R1 nor R2 is transitive.
1- x
33. (d) Suppose y = f (x)
1
Þ (f2oJ) (f1(x)) = x -1
1- x Þ y=
x-2
1
Þ yx – 2y = x – 1
1 x
= Þ (y – 1) x = 2y – 1
æ 1ö 1 1 é 1ù
Þ (f2o J) çè ÷ø = 1 - 1 -1 êëQ f1 ( x ) = x úû 2y -1
x x
Þ x = f –1 (y) =
x y -1
As the function is invertible on the given domain and its
x é1 ù
Þ (f2o J)(x) = êë x is replaced by x úû inverse can be obtained as above.
x -1 34. (d) f (g(x)) = x
x Þ f (310x – 1) = 210 (310 . x – 1) + 1 = x
Þ f2 (J(x)) =
x -1 Þ 210 (310x – 1) + 1 = x
Þ x (610 – 1) = 210 – 1
x
Þ 1 – J(x) = [Q f2(x) = 1 – x]
x -1 210 - 1 1- 2-10
Þ x= =
x 1 610 - 1 310 - 2-10
\ J(x) = 1 - = = f 3 ( x)
x -1 1- x 1 x -1
31. (c) Here, 35. (c) f1 (x) = f0 + 1 (x) = f0 (f0 (x)) = =
1 x
R1 = {(x, y) Î N × N : 2x + y = 10} and 1-
1- x
R2 = {(x, y) Î N × N : x + 2y = 10}
For R1; 2x + y = 10 and x, y Î N 1
f2 (x) = f1 + 1 (x) = f0 (f1 (x)) = =x
So, possible values for x and y are: x -1
1-
x = 1, y = 8 i.e. (1, 8); x
x = 2, y = 6 i.e. (2, 6);
1
x = 3, y = 4 i.e. (3, 4) and f3 (x) = f2 + 1 (x) = f0 (f2 (x)) = f0 (x) =
1- x
x = 4, y = 2 i.e. (4, 2).
R1 = {(1, 8), (2, 6), (3, 4), (4, 2)} x -1
f4 (x) = f3 + 1 (x) = f0 (f3 (x)) =
Therefore, Range of R1 is {2, 4, 6, 8} x
R1 is not symmetric
1
Also, R1 is not transitive because (3, 4), (4, 2) Î R1 but \ f0 = f3 = f6 = .......... =
(3, 2) Ï R1 1- x
Thus, options A, B and D are incorrect. x -1
For R2; x + 2y = 10 and x, y Î N f1 = f4 = f7 = .......... =
x
So, possible values for x and y are: f2 = f5 = f8 = .......... = x
x = 8, y = 1 i.e. (8, 1);
x = 6, y = 2 i.e. (6, 2); 2
3 -1 2 æ 2 ö 3 - 1 1
x = 4, y = 3 i.e. (4, 3) and f100 (3) = = f1 ç ÷ = =-
x = 2, y = 4 i.e. (2, 4) 3 3 è 3ø 2 2
R2 = {(8, 1), (6, 2), (4, 3), (2, 4)} 3
Therefore, Range of R2 is {1, 2, 3, 4}
æ 3ö 3
R2 is not symmetric and transitive. f2 ç ÷ =
è 2ø 2
32. (a) Both R1 and R2 are symmetric as
For any (x, y) Î R1, we have æ 3ö
æ 2ö 5
(y, x) Î R1 and similarly for R2 \ f100 (3) + f1 ç ÷ + f2 ç ÷=
è 3ø è ø
2 3
EBD_8344
M-260 Mathematics
36. (b) Since f (x) and g(x) are inverse of each other Now f ( x ) = f -1 ( x )
Þ f ( x ) = x Þ ( x - 1) + 1 = x
1 2
\ g'( f (x)) =
f '( x )
Þ x 2 - 3 x + 2 = 0 Þ x = 1, 2
æ 1 ö Hence statement-1 is correct
Þ g '( f ( x)) = 1 + x5 çèQ f ¢ ( x) = ÷
1 + x5 ø 39. (d) Given that f (x) = (x + 1)2 –1, x ³ –1
Here x = g(y) Clearly Df = [–1, ¥ ) but co-domain is not given. Therefore
f (x) is onto.
g ¢( y ) = 1 + [ g ( y )]
5
\ Let f (x1) = f (x2)
Þ (x1 + 1)2 – 1 = (x2 + 1)2 – 1
Þ g ¢ ( x ) = 1 + ( g ( x) ) 5 Þ x1 = x2
37. (d) Let A and B be non-empty sets in R. \ f (x) is one-one, hence f (x) is biection
Let f : A ® B is biective function. Q (x + 1) being something +ve, " x > –1
\ f –1(x) will exist.
Clearly statement - 1 is true which says that f is an onto
Let (x + 1)2 –1 = y
function.
Statement - 2 is also true statement but it is not the Þ x +1 = y +1 (+ve square root as x +1 ³ 0 )
correct explanation for statement-1
Þ x =–1+ y +1
38. (a) Given f is a biective function
Þ f –1 (x) = x +1 –1
\ f :[1, ¥) ® [1, ¥)
Then f (x) = f –1 (x)
f ( x ) = ( x - 1) + 1, x ³ 1
2
Þ (x + 1)2 – 1 = x +1 –1
Let y = ( x - 1) + 1 Þ ( x - 1) = y - 1
2 2 Þ (x + 1)2 = x + 1 Þ (x + 1)4 = (x + 1)
Þ (x + 1) [ (x + 1)3 – 1] = 0 Þ x = – 1, 0
Þ x = 1± y - 1 Þ f -1 ( y ) = 1 ± y - 1 \ The statement-1 and statement-2 both are true.
40. (d) Clearly f (x) = 4x + 3 is one one and onto, so it is
Þ f -1 ( x ) = 1 + x - 1 {\ x ³ 1} invertible.
Hence statement-2 is correct Let f (x) = 4x + 3 = y
y –3 y –3
Þx= \ g ( y) =
4 4