Solutions: Section - A

Chapter 1
Relations and Functions
Solutions
SECTION - A
School/Board Exam. Type Questions
Very Short Answer Type Questions :
1. Consider the set A = {a, b, c}. Give an example of a relation R on A which is reflexive and symmetric but
not transitive.
Sol. R = {(a, a), (a, b), (b, a), (b, c), (c, b), (b, b), (c, c)} on A is relation which is a reflexive, symmetric but not
transitive.
2. Let f, g be the functions f = {(1, 5), (2, 6), (3, 4)}, g = {(4, 7), (5, 8), (6, 9)}. What is the range of f and g?
Sol. Range of f = {4, 5, 6}
and Range of g = {7, 8, 9}
x
3. If f : R  R is defined by f ( x )  , find f(f(2)).
x 1
2
2 2
Sol. Here,
f (2) 
2 1 5
2
2
⎛2⎞ 5 10
So, f (f
(2)) f 
⎜5⎟ 
2
⎝ ⎠ ⎛2⎞ 29
⎜ 5 ⎟ 1
⎝ ⎠
4. If f(x) = x2 – 3x + 2 be a real valued function of the real variable, find fof.

Sol. f(f(x)) = (f(x))2 – 3f(x) + 2 = (x2 – 3x + 2)2 – 3 (x2 – 3x + 2) + 2
 f(f(x)) = x4 – 6x3 + 10x2 – 3x
5. Let f(x) = 3x – 4 for all x  R. Find g : R  R such that gof = IR.
Sol. Clearly, g(x) = f –1(x)
Let f –1(x) = z
 f(z) = x
 3z – 4 = x
x4
 z
3
 f 1( x )  x  4
3
Aakash Educational Services Pvt. Ltd. Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
2 Relations and Functions Solutions of Assignment (Set-1)
6. Let A be a finite set containing n distinct elements. Find the number of one-one functions that can be defined
from A to A.
Sol. Number of one-one functions = nPn = n!
7. Let f(x) = ax + b for all x  R, where a, b  R and a  0, then find f–1(x).

Sol. Let f –1(x) = z
 f(z) = x
 az + b = x
x b
 z
a
⎧ 1, if x  Q ⎧1, if x  Q
8. Let f ( x )  ⎨ and g ( x )  ⎨ , then for all x  R, find f(g(x)).
⎩1, if x Q ⎩ 1, if x Q
Sol. Here, if x  Q, then (fog)(x) = f(g(x)) = f(–1) = 1 and if x Q , (fog)(x) = f(g(x)) = f(1) = 1.
So, f(g(x)) = 1 for all x  R.
9. Let f : R  R be defined by f(x) = 3x – 4, then find f–1(x).

 f(z) = x
 3z – 4 = x
x4
 z
3
10. Let A = {x  R : x  –1}. Let ‘*’ be a operation defined on A by the rule a * b = a + b + ab for all a, b  A,
then find inverse of a  A w.r.t. operation ‘*’.
Sol. If b is inverse of a, then
a*b=b*a=0
 a + b + ab = 0
a
 b
1 a
Short Answer Type Questions :
x2
11. Let f : R  R be defined by f(x) = 3x – 2 and g : R  R be defined by g ( x )  . Show that
3
fog = IR = gof.
⎛ x 2⎞ ⎛ x 2⎞
Sol. For all x  R, (fog)(x) = f(g(x)) = f
⎜ 3 ⎟ 3⎜ 3 ⎟  2
⎝ ⎠ ⎝ ⎠
 f (g ( x )) x IR ( x )
(3 x  2)  2
Again, (gof)(x) = g(f(x)) = g(3x – 2) =
3
 (gof)(x) = IR(x).
Solutions of Assignment (Set-1) Relations and Functions 3
12. Let X = {–2, –1, 0, 1, 2, 3} and Y = {0, 1, 2, ....., 10} and f : X  Y be a function defined by f(x) = x2 for all
x  X, find f –1(A) where A = {0, 1, 2, 4}.
Sol. Here, we have to find f–1(0), f–1(1), f–1(2) and f–1(4)
Now, f(x) = 0
 x2 = 0
 x=0
 f –1(0) = {0}, f(x) = 1
 x2 = 1
 x = –1, 1
 f –1(1) = {–1, 1}
Now, f(x) = 2
 x2 = 2
 x =  2, 2 but none of these is in X
 f –1(2) = 
If f(x) = 4
 x2 = 4
 x = –2, 2
 f –1(4) = {–2, 2}
Hence, f –1(A) = {0, –1, 1, –2, 2}
13. Let f : R  R be defined by f(x) = 7x – 3. Show that f is invertible, find f–1.
Sol. Obviously, the given function f(x) = 7x – 3 is one-one onto,
Now, let y = f(x)
 y = 7x – 3
y 3
 x
7
1 x 3
 f (x)  x R
7
ax  b
14. If f ( x )  , show that f(f(x)) = x.
bx  a
ax  b ⎞
Sol. Here, f (f ( x ))  f ⎛⎜ ⎟
⎝ bx  a ⎠
⎛ ax  b ⎞
a⎜ ⎟  b a 2 x  ab  b 2 x  ab
⎝ bx  a ⎠  
a2  b2 x  x
= ⎛ ax  b ⎞ abx  b 2  abx  a 2 =
b⎜ ⎟ a (a 2  b 2 )
⎝ bx  a ⎠
 f(f(x)) = x
15. Let a binary operation ‘*’ be defined on R by a * b = b for all a, b  R, then prove that the given operation
is not commutative but is associative.
Sol. a * b = b and b * a = a
Since a  b in general, therefore a * b  b * a
Also, (a * b) * c = b * c = c
and a * (b * c) = a * c = c
So, given operation is not commutative but is associative.
16. If f : R  R, then prove that f(x) = x3 + x2 + 3x + sinx is bijective.
Sol. Testing of one-one
f(x) = x3 + x2 + 3x + sinx
 f(x) = (3x2 + 2x + 3) + cosx
8
As, 3x2 + 2x + 3  , so f(x) > 0  x  R
3
Therefore, f(x) is one-one function.
Also, range of f(x) is R = co-domain.
So, f(x) is onto function.
Hence, f(x) is bijective
17. If f : [–1, )  [–1, ), f(x) = (x + 1)2 – 1 and f(x) = f –1(x) then find the value of x.
Sol. As, solution of the equation f(x) = f–1(x) is equivalent to the solution of f[f(x)] = x
 [(x + 1)2 – 1 + 1]2 –1 = x
(x + 1)4 = 1 + x
 (x + 1) [(x + 1)3 – 1] = 0
x = –1 or x = 0
So, set of values of x is {0, –1}.
⎡x⎤
18. Let f : [2, 4)  [1, 3) be a function defined by f ( x ) x  ⎢ ⎥ (where [.] denotes the greatest integer function).
⎣2⎦
Then find f–1.
Sol. Here, 2  x < 4
⎡x⎤
 1⎢ ⎥  2
⎣2⎦
⎡x⎤
 ⎢2⎥  1
⎣ ⎦
So, f(x) = x – 1
Let f –1(x) = z
 f(z) = x
 z–1=x
 z=x+1
i.e., f–1(x) = x + 1
ax  b
19. Find the condition so that a real valued function f defined by f ( x )  is self invertible, where c  0.
cx  d
(Consider that f(x) is invertible)
ax  b
Sol. The given function f is defined by f ( x )  is self invertible if f(f(x)) = x
cx  d
af ( x )  b
 x
cf ( x )  d
⎛ ax  b ⎞
a⎜ ⎟b
⎝ cx  d ⎠ x
 ⎛ ax  b ⎞
c⎜ ⎟  d
⎝ cx  d ⎠
 (a + d) (cx2 + (d – a)x – b) = 0
 a+d=0 (as, c  0)
20. If f : [–1, 1]  B and f(x) = sin–1x, if f(x) is one-one onto function, then find the value of B.
Sol. In one-one onto function,
Range of f = Co-domain of f (which is B)
⎡   ⎤
So, Range of function for x  [–1, 1] is ⎢ , ⎥ .
⎣ 2 2⎦
⎡   ⎤
So, B  ⎢ , ⎥
⎣ 2 2⎦
⎛ x 1⎞ x 1
2
21. If f ⎜ ⎟  , then find the value of f(2).
⎝ x 2⎠ x 2
2
x 1
Sol. Put y
x2
1  2y
 x
y 1
2
⎛ 1  2y ⎞
⎜ y 1 ⎟ 1
So, f ( y )  ⎝ ⎠
2
⎛ 1  2y ⎞
⎜ y 1 ⎟  2
⎝ ⎠
 f ( y )  (1  2y )2  ( y  1) 2
2 2
(1  2y )  2( y  1)
(1  4)2  (2  1)2 8

So, value of f (2) 
(1  4)  2(2  1)
2 2
11
22. Check whether the relation R defined on the set A = {1, 2, 3, 4} as R = {(a, b) : b = a + 1} is reflexive,
symmetric or transitive.
Sol. Here, R = {(1, 2), (2, 3), (3, 4), (4, 5)}
Obviously, R is not reflexive as (a, a )R  a R .
Also, if (1, 2)  R ⇒ (2, 1),  R

So, R is not symmetric.
Now, as (1, 2)  R and (2, 3)  R
 (1, 3)  R
So, R is not transitive

Hence R is neither reflexive nor symmetric nor transitive.
23. Let A = {1, 2, 3, 4}. Find the number of onto functions from set A to set A.
Sol. Required number of onto functions
= 44 – 4C1 . 34 + 4C2 . 24 – 4C3 . 14
= 256 – 324 + 96 – 4
= 352 – 328 = 24
24. Let f(x) = 1 – x and g(x) = 1 + x2, then find fog and gof.
Sol. fog = f(g(x)) = f(1 + x2) = 1 – (1 + x2) = –x2
Also, gof = g(f(x)) = g(1 – x) = 1 + (1 – x)2 = x2 – 2x + 2
25. Let g : R  R be given by g(x) = 1 + 2x. If gn(x) = gogo

....og (
x ) , then find g4(1).
n times
Sol. Here, g2(x) = g(g(x)) = g(1 + 2x) = 1 + 2 (1 + 2x) = 3 + 4x

Now, g3(x) = g(g(g(x))) = g(3 + 4x) = 1 + 2(3 + 4x) = 7 + 8x
So, g4(x) = g(g3(x)) = g(7 + 8x) = 1 + 2(7 + 8x) = 15 + 16x
g(1) = 15 + 16 = 31
1 3
26. Let f ( x )   x  and (x) = f –1(x), then find the value of (30).
2 4
Sol. Let f –1(30) = z

 f(z) = 30
1 3
  z 30
2 4
2
3 ⎛ 59 ⎞
 z 
4 ⎜⎝ 2 ⎟⎠
3 3481 3484
 z  
4 4 4
 z = 871
x 1
27. Let f : R –{–2}  R – {1} be given by f ( x )  . Find f–1(x).
x2
 f(z) = x
z 1
 x
z2
2x  1
 z
1 x
1 2x  1
 f (x) 
1 x
As, in given domain and co-domain, the given function is bijective so, we need not to check it.
1 x ⎛ ⎛ 1 ⎞⎞
28. Let us consider a real valued function f defined as
f (x) , x   1 . Find the value of f (f ( x ))  f ⎜ f ⎜ ⎟ ⎟ .
1 x ⎝ ⎝ x ⎠⎠
where x  0.
1
1
⎛
Sol. Here, f 
1⎞ x x 1
⎜x⎟ 
⎝ ⎠ 1 1 x  1
x
1 x
1
Now,  1  f ( x ) 1 x x
f (f ( x ))  
1 f (x) 1 1 x
1 x
⎛ 1⎞
1 f ⎜ ⎟ 1 x  1
Also, f ⎛⎜ ⎛ 1 ⎞⎞
f ⎜ ⎟⎟  ⎝x⎠  x 1 1
⎝ ⎝ x ⎠⎠ 1
⎛ ⎞ x 1 x
1 f ⎜ ⎟ 1
⎝x⎠ x 1
⎛ 1 ⎞ 1
So, f (f ( x ))  f ⎜ f ⎛⎜ ⎞⎟ ⎟ x
⎝ ⎝ x ⎠ ⎠ x
29. Let A = {a, b}. Find the number of binary operations that can be defined on A.
Sol. A binary operation on a non-empty set A is mapping from A × A  A
Here A contains two elements, therefore A × A contains 2 × 2 = 4 elements. If ‘*’ is a binary operation on A,
then ‘*’ : A × A can be defined in 24 = 16 ways.
Thus, we can define 16 binary operations on A.
30. Let A be the set of all real numbers except 1 and 0 be an operation on A defined by aob = a + b – ab for
all a, b  A. Prove that A is closed under the given operation.
Sol. Consider any a, b  A
 a  1, b  1
Obviously, a + b – ab is real number but we must show that a + b – ab  1.
If possible, let a + b – ab = 1
 (a – 1) (b – 1) = 0
Either a = 1 or b = 1, which is wrong.
Therefore, for all a, b  A
 a + b – ab  A
 aob  A
31. Let A = {2, 3, 4, 5, 6, ......, 9}. Let R be the relation on A defined by {(x, y) : x  A, y  A and x divides y}.
Find, (i) R, (ii) Domain of R, (iii) Range of R, (iv) R–1
Sol. Here, x R y iff x divides y, therefore,
(i) R = {(2, 2), (2, 4), (2, 6), (2, 8), (3, 3), (3, 6), (3, 9), (4, 4), (4, 8), (5, 5), (6, 6), (7, 7), (8, 8), (9, 9)}
(ii) Domain of R = {2, 3, 4, 5, 6, 7, 8, 9} = A
(iii) Range of R = {2, 3, 4, 5, 6, 7, 8, 9} = A
(iv) R–1 = {(y, x) : x, y  R}
= {(2, 2), (4, 2), (6, 2), (8, 2), (3, 3), (6, 3), (9, 3), (4, 4), (8, 4), (5, 5), (6, 6), (7, 7), (8, 8), (9, 9)}
Infact R–1 is {(y, x) : x, y  A, y is divisible by x}
Long Answer Type Questions :

32. For complex numbers z1 = x1 + iy1 and z2 = x2 + iy2. We write z1  z2 if x1  x2 and y1  y2. Then for all
1 z
complex number z with 1  z, show that we have 0.
1 z
Sol. Let z = x + iy be any complex number such that 1  z
 1  x and 0  y
1  z (1  x )  iy (1  x )  iy (1  x 2 )  y 2  2yi 1 x2  y 2 ⎧ 2y ⎫

Now,  =  ⎨ 2⎬
i
1  z (1  x )  iy (1  x )  iy (1  x )  y
2 2
(1  x )  y
2 2
⎩ (1  x )  y ⎭
2
Since 1  x and 0  y, therefore, we must have

x  1 and y  0
 x2  1 and –2y  0
1 x2  y 2 2y
  0 and 0
(1  x )  y
2 2
(1  x )2  y 2
1 z
  0 , as desired
1 z
z1  z2
33. A relation R on the set of complex numbers is defined as z1Rz2 iff z  z is real. Show that R is an
1 2
equivalence relation.
z1  z2
Sol. Given, z1Rz2 iff z  z is real.
1 2
z1  z1
Now, z1 R z2 iff is real i.e. iff 0 is real, which is true
z1  z1
 The relation R is reflexive.
Also, z1 R z2
z1  z2
 z1  z2 is real
z2  z1
 z1  z2 is real
So, the relation R is symmetric

Let z1 = a + ib, z2 = c + id, z3 = e + if be any three complex numbers, where a, b, c, d, e, f are reals.
z1  z2 (a  c )  i ( b  d )
Then z1 R z2 iff is real, iff is real
z1  z2 (a  c )  i ( b  d )
(a 2  c 2  b 2  d 2 )  i {(a  c )(b  d )  (a  c )(b  d )}

i.e., iff is real
(a  c )2  (b  d )2
 (a + c) (b – d) = (a – c) (b + d)
 ad = bc
Now, z1Rz2 and z2Rz3
 ad = bc and cf = ed
 adcf = bced
 af = bc, where cd  0
 z1Rz3 and when cd = 0, then transitivity is obvious
 The relation R is transitive.
Hence, the given relation R is an equivalence relation
34. Let f : R  R be defined by
(i) f(x) = x + 1 (ii) f(x) = x + |x|
Determine whether functions are onto or not.
Sol. (i) Here, f(x) = x + 1 for all x  R for any y  R, y = f(x)
 y=x+1
 x=y–1
This means that for every y  R, there is y – 1  R such that f(y – 1) = y
So, f is onto.
(ii) Here, f(x) = x + |x|
⎧ x  x, if x  0
 f (x)  ⎨
⎩ x  x, if x  0
⎧2x, x  0
 f ( x )  ⎨0, x  0
⎩
Thus, f(x) cannot be negative for any x  R. So, f is not onto. Not that Rf = [0, ), which is a proper
subset of R.
35. Let f : A  A be such that fof = f. Show that f is onto if and only if f is one-one. Describe f in this case.
Sol. First, set f be one-one. We shall show that f is onto
Let y  A be arbitrary, then
(fof)(y) = f(y)
 f(y) = y (∵ f is one-one)
Thus, corresponding to any y  A, there exists y  A
Such that f(y) = y
 f is onto
Conversely, let f be onto. We shall prove that f is one-one.
Let x1, x2  A. As f is onto, there exist a, b  A
Such that x1 = f(a) and x2 = f(b)
Suppose that f(x1) = f(x2)
 f(f(a)) = f(f(b))
 f(a) = f(b)
 x1 = x2
Thus, f(x1) = f(x2)  x1 = x2
So, f is one-one
Thus, f is onto iff f is one-one
 f is the identity function on A.
36. Let f : R  R be defined by f(x) = 2x3 – 1. Show that f is invertible. Find f –1.
Sol. Testing of one-one :
Let x1, x2  R such that f(x1) = f(x2)
 2x13 
1 2x23  1
 x1 = x2
So, f(x) is one-one function
Testing of onto:
Let f(x) = y
 2x3 – 1 = y
1/3
⎧1  y ⎫
 x⎨ ⎬
⎩ 2 ⎭
i.e., for every y  R, there exist x  R;
f(x) is onto fuction
i.e., f(x) is one-one onto function
1/3
1 ⎧1  x ⎫
Hence, f(x) is invertible and f ( x )  ⎨ ⎬
⎩ 2 ⎭
37. Find the values of a for which the function f(x) = 1 + ax, a  0 is the inverse to itself.
Sol. f (f 1( x ))  x
But given f –1(x) = f(x)
So, f (f ( x )) x  x  R
 f (1  ax ) x  x  R
 1 + a(1 + ax) = x x R
 1 + a + a2x = x x R
 (1 + a) + (a2 – 1)x = 0 R
So, a = –1
x
38. Let f ( x )  , then find (fofof)(x).
1 x2
x
⎛ x ⎞ 1 x2

Sol. (fof )( x ) f 
(f ( x )) f ⎜  ⎟
⎝ 1 x ⎠
2 2
⎛ x ⎞
1 ⎜ ⎟
⎝ 1 x ⎠
2
x
 (fof )( x ) 
1  2x 2
⎛ x ⎞
⎜ ⎟
⎛ x ⎞ ⎝ 1  2x ⎠
2
So,
(fofof )( x ) f 
⎜ ⎟
⎝ 1  2x ⎠
2 2
⎛ x ⎞
1 ⎜ ⎟
⎝ 1  2x ⎠
2
x
=
1 3x 2
39. Let f, g, h : R  R, given by f(x) = 2x + 1, g(x) = 1 – 4x and h(x) = x2 + 1. Find fogoh and gofoh.
Sol. fogoh  f ( g ( h( x )))  f ( g ( x 2  1))  f (1  4( x 2  1))
= 2(1 – 4(x2 + 1)) + 1

= 2{–3 –4x2} + 1
= –5 – 8x2
gofoh = g(f(h(x))) = g(f(x2 + 1)) = g(2(x2 + 1) + 1)
= g(3 + 2x2)
= 1 – 4(3 + 2x2)
= –11 – 8x2
40. Find the domain and the range of the function f(x) = 2x2 – 1. Also find f(1) and the numbers which are
associated with the number 31 in its range. Is this function one-one.
Sol. As, domain of the function f(x) = 2x2 – 1 is R
i.e., Df = R
for Rf, Let y = f(x) = 2x2 – 1
As, 2x2 – 1  –1
 Rf  [–1, )
Now, f(1) = 2.12 – 1 = 1
As, 31 Rf, on putting y = 31 in y = f(x),
 2x2 – 1 = 31
 x = 4, –4
Therefore, 4 and –4 are the numbers which are associated with the numbers 31 in Rf.
 Different elements in Df have the same image,
Therefore, f is not one-one.
41. Let Nm be the set of all ordered m-tuples of natural numbers. If x = (x1, x2, x3, ....., xm), y = (y1, y2, y3, ...., ym)
where xi, yi  N, i = 1, 2, 3, ...., m and an operation ‘+’ is defined Nm by x + y = (x1 + y1, x2 + y2, ......,
xm + ym), then prove that given operation is commutative as well as associative.
Sol. Here, x + y = (x1 + y1, x2 + y2, ......, xm + ym)
= (y1 + x1, y2 + x2, ......, ym + xm) = y + x
Let z = {z1, z2, z3, ...., zm}, where zi  N for all i = 1, 2, 3, ....., n
Then (x + y) + z
= (x1 + y1, x2 + y2, ..... xm + ym) + (z1, z2, ....., zm)
= (x1 + y1) + z1, (x2 + y2) + z2, ......, (xm + ym) + zm
= x1 + (y1 + z1), x2 + (y2 + z2), ......, xm + (ym + zm)
= (x1, x2, x3, ...., xm) + (y1 + z1, y2 + z2, ...... ym + zm)
= x + (y + z)
So, given operation is commutative as well as associative
42. Prove that f : N  N, defined by f(m) = m2 + m + 1 for all m  N, is one-one but not onto.
Sol. Given, f(m) = m2 + m + 1 for all mN
Let f(m) = f(n); m, n  N
 m2 + m + 1 = n2 + n + 1
 m2 – n2 = n – m
 (m + n) (m – n) – (m – n) = 0
 (m – n) (m + n – 1) = 0
 m = n {as, m + n  1}
 f is one-one.
Also, f(m) = m2 + m + 1  3 for all mN.
So, f is not onto.
In fact, Rf = {3, 7, 13, 21, 31, ......}
as f(m) = m(m + 1) + 1
43. Let a binary operation ‘*’ on Q(set of all rational numbers) be defined by a * b = a + 2b for all a, b  Q.
Prove that :
(i) Q is closed under the given operation
(ii) The given operation is not commutative
(iii) The given operation is not associative
Sol. (i) For all a, b  Q
 a + 2b  Q
 Q is closed under the given operation
(ii) 1 * 2 = 1 + 2.2 = 5
and 2 * 1 = 2 + 2.1 = 4
 1*22*1
 The given operation is not commutative
(iii) (1 * 2) * 3 = (1 + 2.2) * 3 = 5 * 3 = 5 + 2.3 = 11 and
1 * (2 * 3) = 1 * (2 + 2.3) = 1 * 8 = 1 + 2.8 = 17
 The given operation is not associative.
⎛ ex ⎞
44. Let f ( x ) 
1  2 sin ⎜ x ⎟ , x  0 , then find f (x). (assuming f is bijective).
–1
⎝ e  1 ⎠
⎛ ex ⎞
Sol. Here, y 
1  2sin ⎜ x ⎟, x  0
⎝ e  1⎠
⎛ ex ⎞
 y 12 sin ⎜ x ⎟
⎝ e  1⎠
ex ⎛ y  1⎞
  sin1 ⎜ ⎟
e 1
x
⎝ 2 ⎠
⎛ y  1⎞
sin1 ⎜ ⎟
 e  x ⎝ 2 ⎠
⎛ y  1⎞
1  sin1 ⎜ ⎟
⎝ 2 ⎠
⎧ 1 ⎛ y  1 ⎞ ⎫
⎪⎪ sin ⎜ 2 ⎟ ⎪⎪
 x  log ⎨ ⎝ ⎠
⎬
⎪1  sin1 ⎜⎛ y  1⎞ ⎪
⎟
⎩⎪ ⎝ 2 ⎠ ⎭⎪
⎧ 1 ⎛ x  1 ⎞ ⎫
⎪⎪ sin ⎜ 2 ⎟ ⎪⎪
i.e., f 1( x )  log ⎨ ⎝ ⎠
⎬
⎪1  sin ⎜
 1 ⎛ x  1⎞ ⎪
⎪⎩ ⎟
⎝ 2 ⎠ ⎪⎭
⎧x3; x 1
⎪
45. If
f ( x ) ⎨ x; 1  x  4 , then find the inverse of f(x).
⎪
⎩2 x ; x  4
Sol. We have,
⎧x3; x 1
⎪
 f ( x ) ⎨ x; 1 x  4
⎪
⎩2 x ; x4
Let y = f(x)  x = f–1(y)
We have,
⎧ y 1/3 ; y  1
⎪
x ⎪y; 1 y  4
⎨
2
⎪y
⎪⎩ 4 ; y  4
⎧ y 1/3 ; y  1
⎪
f 1 ⎪ y ;
 1 y  4
⎨
2
⎪y
⎪⎩ 4 ; y  4
⎧ x1/3 ; x  1
1 ⎪
Hence, f  ( x ) ⎪ x; 1 x  4
⎨
2
⎪x
⎪⎩ 4 ; x  4
SECTION - B
Model Test Paper
Very Short Answer Type Questions :
1. Give an example to show that the relation R in the set of natural numbers, defined by R = {(x, y), x, y  N,
x  y2} is not transitive.
Sol. (8, 3)R and (3, 2)R but (8, 2)  R.
2. Write the number of all one-one functions from the set A = {a, b, c} to itself.
Sol. Number of one-one functions = 3P3 = 3! = 6.
3. Find the number of relation from set A = {2, 3, 4} to B = {x : (x – 4) (x – 5) = 0}.
Sol. n(A) = 3, n(B) = 2
So, number of relations = 2n(A) × n(B) = 26 = 64
4. If maximum number of subsets of a set A is 4096, then find the cardinal number of A.
Sol. Given, 2n(A) = 4096
 n(A) = 12
5. If f(x) = 2x, then find f–1(x). (Assume the function is one-one onto function)
Sol. Let f–1(x) = z
 f(z) = x
 2z = x
 z = log2x
So, f–1(x) = log2x
6. If f : R  R and g : R  R be two functions defined by f(x) = x2 and g(x) = x3 – 1 respectively, then find
(fog)(x).
Sol. fog(x) = f(g(x)) = f(x3 – 1) = (x3 – 1)2 = x6 – 2x3 + 1.
7. If * be a operation in R such that a * b = LCM of (a, b); find the value of 5 * 6.
Sol. 5 * 6 = LCM of 5 and 6 = 30.
⎧ 1; x  0
⎪
8. 
Let g(x) = {x} – 1 and f ( x ) ⎨0; x 0 , then for all x, find f(g(x)), where {} represents fractional function.
⎪1; x 0
⎩
Sol. We have,
⎧ 1; x  0
⎪

g(x) = {x} – 1 and f ( x ) ⎨0; x 0
⎪1; x 0
⎩
⎧1; g ( x )  0
⎪

f (g ( x )) ⎨
0; g ( x ) 0
⎪1; g( x )  0
⎩
⎧ 1; { x }  1  0
⎪
 ⎨0;  {x}  1 0
⎪1; {x}  1  0
⎩
⎧ 1; { x }  1
⎪
 ⎨0; { x } 1
⎪1; {x}  1
⎩
= –1; x  R
Short Answer Type Questions :

9. Let N be the set of all natural numbers and R be the relation in N × N defined by (a, b)R(c, d) if
ad = bc. Show that R is an equivalence relation.
Sol. For any (a, b)  N × N, ab = ba
 (a, b)R (a, b)
Thus R is reflexive.
Let (a, b)R(c, d) for any a, b, c, d  N
 ad = bc
 cb = da
 (c, d)R(a, b)
 R is symmetric.
Let (a, b)R(c, d) and (c, d)R(e, f) for a, b, c, d, e, f  N
Then ad = bc and cf = de
 adcf = bcde
 af = be
 (a, b)R(e, f)
 R is transitive
Hence, R is an equivalence relation.
10. Show that the function f : R  R defined by f(x) = 2x3 – 7, for x  R is bijective.
OR
Let f, g : R  R be defined as f(x) = |x| and g(x) = [x] where [x] denotes the greatest integer less than or
⎛5⎞
equal to x. Find fog ⎜ ⎟ and gof (  2) .
⎝2⎠
Sol. Let x1, x2  R such that f(x1) = f(x2)
 2 x13  7 2 x23  7
 x1 = x2
So, f is one-one function
Now, let y be any element in R (co-domain)
 f(x) = y
 2x3 – 7 = y
1/3
⎛y 7⎞
x ⎜ ⎟
⎝ 2 ⎠
1/3
⎛y 7⎞

Now, for all yR, there exists x ⎜ ⎟ R (domain)
⎝ 2 ⎠
 f is onto function
Hence, f is a bijective function
OR
⎛5⎞ ⎛ ⎛ 5 ⎞⎞
fog ⎜ 
⎟ f ⎜ g ⎜ 2 ⎟  | 2| 2
⎟ f (2)
⎝2⎠ ⎝ ⎝ ⎠⎠
gof (  2)  g ⎡⎣f (  2)⎤⎦  g ⎡⎣|  2 |⎤⎦  g ⎡⎣ 2 ⎤⎦  1
11. Show that the relation R in the set A = {x : x  Z, 0  x  12} given by R = {(a, b) : |a – b| is divisible by 4}
is an equivalence relation.
Sol. (i) aA, |a – a| = 0 is divisible by 4.
So, R is reflexive ...(i)
(ii) a, b  A
 |a – b| is divisible by 4
 |b – a| is divisible by 4
So, R is symmetric ...(ii)
(iii) a, b, c  A, (a, b)  R and (b, c)  R as (a – b) and (b – c) are divisible by 4 and
so (a – b) + (b – c) = (a – c) is divisible by 4
Hence R is transitive ... (iii)
From (i), (ii), (iii); R is an equivalence relation.
⎛ 2 ⎞ ⎛ 2 ⎞ ⎛3⎞
12. If f ( x
) cos2 x  cos2 ⎜  x ⎟  cos x.cos ⎜  x ⎟,g ⎜ ⎟ 
1 then find gof(x).
⎝ 3 ⎠ ⎝ 3 ⎠ ⎝4⎠
⎧ ⎛ 2 ⎞⎫ 1 ⎛ 2 ⎞
Sol. Given, f ( x ) 
1  ⎨cos2 x  sin2 ⎜  x ⎟ ⎬  .2cos x.cos ⎜  x⎟
⎩ ⎝ 3 ⎠⎭ 2 ⎝ 3 ⎠
2 ⎛ 2 ⎞ 1 ⎧ ⎛ 2 ⎞ 2 ⎫
= 1  cos .cos ⎜ 2 x  ⎟  ⎨cos ⎜ 2 x  ⎟  cos ⎬
3 ⎝ 3 ⎠ 2⎩ ⎝ 3 ⎠ 3 ⎭
3
 f (x) 
4
⎛3⎞
Now, g (
f ( x )) g
⎜ 4 ⎟ 1 . (given)
⎝ ⎠
13. If f : R  R, f(x) = x3 – x + 1, find the solution of f(x) = f–1(x).
Sol. As, f(x) = f–1(x)
 f(x) = x
 x3 – x + 1 = x
 x3 – 2x + 1 = 0
 (x – 1) (x2 + x – 1) = 0
1  5
 x  1,
2
14. Let A = {1, –1, i, –i}, where i 1 . Draw the composition table corresponding to binary operation
multiplication on A.
OR
If * is a binary operation defined on Q. Find which of the binary operations are commutative
(i) a * b = a – b  a, b  Q
(ii) a * b = a2 + b2  a, b  Q
(iii) a * b = a + ab  a, b  Q
Sol. (i) Composition table :
 1 1 i i
1 1 1 i i
1 1 1 i i
i i i 1 1
i i i 1 1
OR
(ii) is commutative, while (i), (iii) are not commutative.
Long Answer Type Questions :
ab
15. Discuss the commutativity and associativity of the binary operation on R defined by a * b  for all a, b  R.
4
Sol. Obviously, * is commutative as well as associative.
16. Consider the set S = {1, 2, 3, 4}. Define a binary operation on S as follows a * b = r, where r is the least non-
negative remainder when ab is divided by 5. Construct the composition (operation) table for * on S.
Sol. * 1 2 3 4
1 1 2 3 4
2 2 4 1 3
3 3 1 4 2
4 4 3 2 1
3 x  3 x
17. If f(x) is one-one onto function defined by f ( x )  then find f–1(x).
3 x  3 x
OR
If f(x) = 8x – 3 and g(x) = 3x – 8, then find (fog)–1(x).
Sol. Let f–1(x) = z
 f (z)  x
3z  3 z x
 
3z  3 z 1
Applying componendo and dividendo, we get
2.3 z 1  x

2.3  z 1  x
1 x
 3 
2z
1 x
⎛ 1 x ⎞
so, 2z  log3 ⎜ ⎟
⎝ 1 x ⎠
1 ⎛ 1 x ⎞
 z log3 ⎜ ⎟
2 ⎝ 1 x ⎠
1 ⎛ 1 x ⎞
so, f 1( x )  log3 ⎜ ⎟
2 ⎝ 1 x ⎠
OR
f(g(x)) = f(3x – 8) = 8(3x – 8) – 3 = 24x – 67
Let h(x) = 24x – 67
If h–1(x) = z
 h(z) = x
 24z – 67 = x
x  67
 z
24
1 x  67
So, h ( x ) 
24
18. Show that the function f : R  R defined by f(x) = cos(5x + 2) is neither one-one nor onto?
Sol. f(x) = cos(5x + 2)
Now, f(2) = cos(10 + 2) = cos2 = f(4)
So, f(x) is many-one function
Also, Range of cos(5x + 2)  co-domain R
So, f(x) is not onto function
19. Let A = {1, 2, 3, 4, 5} and let f : A  A and g : A  A be defined by f(1) = 2, f(2) = 3,
f(3) = 4, f(4) = 5, f(5) = 1 and g(1) = 4, g(2) = 1, g(3) = 1, g(4) = 2, g(5) = 3. Find the functions
fog and gof.
OR
x 3
Let f : R  R be defined by f(x) = 2x – 3 and g : R  R be defined by g ( x )  . Show that fog = IR = gof.
2
Sol. fog :
f(g(1)) = f(4) = 5; f(g(2)) = f(1) = 2
f(g(3)) = f(1) = 2; f(g(4)) = f(2) = 3; f(g(5)) = f(3) = 4
gof :
g(f(1)) = g(2) = 1; g(f(2)) = g(3) = 1
g(f(3)) = g(4) = 2; g(f(4)) = g(5) = 3
g(f(5)) = g(1) = 4
OR
Here, f ( ⎛ x 3⎞ ⎛ x 3⎞

g ( x )) f ⎜  ⎟ 2⎜ ⎟3 x
⎝ 2 ⎠ ⎝ 2 ⎠
(2 x  3)  3
gof ( x
) g (f ( x )) g (2 x  3)  x
2
3x  4 6 3 29 x  36
20. If f ( x )  ,x , f ( x )  . Show that f (f ( x ))  and what is the inverse of f ?
5x  6 5 5 45 x  56
3f ( x )  4
Sol. Here f(f(x)) =
5f ( x )  6
⎛ 3x  4 ⎞
3⎜ ⎟  4 (9 x  12)  (20 x  24) 29 x  36
 ⎝ 5x  6 ⎠ 
=
⎛ 3x  4 ⎞ (15 x  20)  (30 x  36) 45 x  56
5⎜ ⎟6
⎝ 5x  6 ⎠
Let f–1(x) = z
 f(z) = x
3z  4
 x
5z  6
 3z + 4 = 5xz + 6x
6x  4
 z
3  5x
6x  4
So, f 1( x ) 
3  5x


Solutions: Section - A

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

Solutions: Section - A

Uploaded by

Copyright:

Available Formats

Chapter 1

Relations and Functions

4. If f(x) = x2 – 3x + 2 be a real valued function of the real variable, find fof.

7. Let f(x) = ax + b for all x  R, where a, b  R and a  0, then find f–1(x).

So, f(g(x)) = 1 for all x  R.

9. Let f : R  R be defined by f(x) = 3x – 4, then find f–1(x).

 x =  2, 2 but none of these is in X

Obviously, R is not reflexive as (a, a )R  a R .

Also, if (1, 2)  R ⇒ (2, 1),  R

So, R is not transitive

25. Let g : R  R be given by g(x) = 1 + 2x. If gn(x) = gogo

Sol. Here, g2(x) = g(g(x)) = g(1 + 2x) = 1 + 2 (1 + 2x) = 3 + 4x

Sol. Let f –1(30) = z

Long Answer Type Questions :

Since 1  x and 0  y, therefore, we must have

So, the relation R is symmetric

(a 2  c 2  b 2  d 2 )  i {(a  c )(b  d )  (a  c )(b  d )}

Let x1, x2  R such that f(x1) = f(x2)

Sol. fogoh  f ( g ( h( x )))  f ( g ( x 2  1))  f (1  4( x 2  1))

= 2(1 – 4(x2 + 1)) + 1

Now, f(1) = 2.12 – 1 = 1

As, 31 Rf, on putting y = 31 in y = f(x),

 Different elements in Df have the same image,

Therefore, f is not one-one.

= (y1 + x1, y2 + x2, ......, ym + xm) = y + x

= (x1 + y1, x2 + y2, ..... xm + ym) + (z1, z2, ....., zm)

= (x1 + y1) + z1, (x2 + y2) + z2, ......, (xm + ym) + zm

= x1 + (y1 + z1), x2 + (y2 + z2), ......, xm + (ym + zm)

So, given operation is commutative as well as associative

Let f(m) = f(n); m, n  N

Also, f(m) = m2 + m + 1  3 for all mN.

So, f is not onto.

In fact, Rf = {3, 7, 13, 21, 31, ......}

Short Answer Type Questions :

Sol. Let x1, x2  R such that f(x1) = f(x2)

gof (  2)  g ⎡⎣f (  2)⎤⎦  g ⎡⎣|  2 |⎤⎦  g ⎡⎣ 2 ⎤⎦  1

13. If f : R  R, f(x) = x3 – x + 1, find the solution of f(x) = f–1(x).

Sol. As, f(x) = f–1(x)

Sol. (i) Composition table :

(ii) is commutative, while (i), (iii) are not commutative.

Long Answer Type Questions :

Sol. Obviously, * is commutative as well as associative.

Applying componendo and dividendo, we get

Here, f ( ⎛ x 3⎞ ⎛ x 3⎞

You might also like