CLS JEEAD-19-20 XII Mat Target-1 Level-1 Chapter-1 PDF

Level-I
Chapter 1
Relations and Functions
Solutions (Set-1)
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)).
x2  1
2 2
Sol. Here, f (2)  
22  1 5
2
2 5 10
So, f (f (2))  f    2

5 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 Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
2 Relations and Functions Solutions of Assignment (Level-I) (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 2
 3   3 
 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 (Level-I) (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
=  = (a 2  b 2 )  x
 ax  b  abx  b 2  abx  a 2
b a
 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}.

ax  b
18. 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)
 x 1 x 1
2
19. 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
 
(1  2y )2  ( y  1)2
 f (y ) 
(1  2y )2  2( y  1)2
(1  4)2  (2  1)2 8
So, value of f (2)  
(1  4)2  2(2  1)2 11
20. 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.
21. 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
22. 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
23. 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
x 1
24. 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 
25. 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
 1 x x 1
Sol. Here, f    
x
  1 1 x 1
x
1 x
1
1 f (x) 1 x  x
Now, f (f ( x ))  
1 f (x) 1 1 x
1 x
 1
1 f   1 x  1
  1  x  x 1  1
Also, f  f    
  x   1 f  1  1 x  1 x
x x 1
 
 1  1
So, f (f ( x ))  f  f     x 
  x  x
26. 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.
27. 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
28. 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 :

z1  z2
29. 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.
30. 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.
31. 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.
32. 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 
33. 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
34. 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
 x   1  2x 
2
So, (fofof )( x )  f   =
 1  2x 
2 2 1 3x 2
 x 
1  
 1  2x 
2
35. 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
36. 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.
37. 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.
38. 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
39. 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.

Level-I
Chapter 1
Relations and Functions
Solutions (Set-2)
Relations
1. Let A = {a, b, c, d} and R = {(a, a), (b, b), (a, c), (c, a)}, then R is
(1) Reflexive (2) Symmetric (3) Transitive (4) Equivalence

Sol. Answer (2)
Reflexivity : R is not reflexive because for x  A, (x, x)  R (∵ each element of A is not related)
Symmetric : For (x, y)  R
 (y, x) also  R
Hence, R is symmetric.
Transitive : We observe that (c, a)  R and (a, c)  R, but (c, c)  R.
Hence, R is not transitive.
2. Let A = {1, 2, 3, 4}. Which of the following is an equivalence relation of A?
(1) {(1, 1), (2, 2), (1, 2), (2, 1)} (2) {(1, 2), (2, 1), (3, 1), (1, 3)}
(3) {(1, 2), (4, 1), (1, 4), (3, 1)} (4) {(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (2, 1)}
Sol. Answer (4)

Options (1), (2), (3) are not reflexive.
Only option (4) is equivalence relation on A.
3. Let R be a relation defined on set A = {1, 2, 3, 4, 5, 6, 7, 8} such that R = {(2, 3) (4, 5) (7, 8)}.
If the domain of R is set B and range is set C, then B  C is
(1)  (2) {2, 4, 7} (3) {3, 5, 8} (4) {3}

Sol. Answer (1)
B = {2, 4, 7}, C = {3, 5, 8}  B C = 
4. Consider two sets A = {a, b}, B = {e, f}. If maximum numbers of relations from A to B, A to A, B to B are l, m, n
respectively then the value of 2l – m – n is
(1) 8 (2) 0 (3) 16 (4) 32
Sol. Answer (2)
4 4 4
l = 2 = 16, m = 2 = 16, n = 2 = 16,
 2l – m – n = 0
5. Consider three sets A = {1, 2, 3}, B = {3, 4, 5, 6}, C = {6, 7, 8, 9}. R1 is defined from A to B such that
R1 = {(x, y) : 4x < y, x  A, y  B}. Similarly R2 is defined from B to C such that R2 = {(x, y) : 2x  y, x  B and
y  C}, then R2–1 o R1 is
(1) {(3, 1)} (2) {(1, 1)} (3) {(1, 3)} (4) 
Sol. Answer (3)
R1 = {(1, 5), (1, 6)}, R2 = {(3, 6), (3, 7), (3, 8), (3, 9), (4, 8), (4, 9)}
R21  {(6, 3), (7, 3), (8, 3), (9, 3), (8, 4), (9, 4)}
R2–1 o R1 = {(1, 3)}

6. Consider the set A = {3, 4, 5} and the numbers of null relations, identity relation, universal relations, reflexive
relations on A are respectively n1, n2, n3 and n4 then the value of n1 + n2 + n3 + n4 is equal to
(1) 8 (2) 7 (3) 73 (4) 67
Sol. Answer (4)
n1 = 1, n2 = 1, n3 = 1, n4 = 29-3 = 26 = 64
 n1 + n2 + n3 + n4 = 1 + 1 + 1 + 64 = 67
7. If n(A) = 3, n(B) = 2, n(A  B) = 2, then total number of relations from A to B is
(1) 64 (2) 32 (3) 8 (4) 2
Sol. Answer (1)
Relations = 26 = 64
8. Let L be the set of all straight lines in a plane. l1 and l2 are two lines in the set. R1, R2 and R3 are defined relations.
(i) l1R1l2 : l1 is parallel to l2 (ii) l1R2l2 : l1 is perpendicular to l2
(iii) l1R3l2 : l1 intersects l2.
Then which of the following is true?
(1) R1, R2 and R3 are equivalence (2) R1 is equivalence
(3) R2 and R3 are reflexive (4) R1, R2 and R3 are not symmetric
Sol. Answer (2)

R1 is reflexive, symmetric as well as transitive
R2 is not reflexive and transitive but it is symmetric
R3 is reflexive, symmetric as well as transitive hence R1 is equivalence
9. Let R be a relation on A = {a, b, c} such that

R = {(a, a), (b, b), (c, c)},
then R is
(1) Reflexive only (2) Symmetric only (3) Non-transitive (4) Equivalence
Sol. Answer (4)

Clearly R is equivalence.
10. Consider the following statements on a set

A = {1, 2, 3}
S1 : R = {(1, 1), (2, 2)} is a reflexive relation on A
S2 : R = {(3, 3)} is symmetric and transitive but not reflexive on A
Which of the following statement on set A is true?
(1) S1 only (2) S2 only (3) Both S1 and S2 (4) Neither S1 nor S2
Sol. Answer (2)
S1 : R is not reflexive due to the absence of (3, 3).
S2 : R is symmetric and transitive.
11. Let R = {(1, 2), (2, 3)} be a relation defined on set {1, 2, 3}. The minimum number of ordered pairs required to be
added in R, such that enlarged relation becomes an equivalence relation is
(1) 3 (2) 5 (3) 7 (4) 9
Sol. Answer (3)
R = {(1, 2), (2, 3)}
If R is equivalence then R will as
R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3), (3, 2), (1, 3), (3, 1)}
Added order pairs = 7
12. Let n be a fixed positive integer. Let a relation R be defined on Z, as aRb iff, n is divisible by a – b, then relation
R is
(1) Reflexive (2) Symmetric (3) Transitive (4) All of these
Sol. Answer (2)
R is not reflexive because if a = b then a – b = 0
n
or a – a = 0, in this case is not possible
0
but R is clearly symmetric.
13. Let S be the set of all real numbers. Then, the relation R = {(a, b) : 1 + ab > 0} on S is
(1) Reflexive and symmetric but not transitive (2) Reflexive and transitive but not symmetric
(3) Symmetric and transitive but not reflexive (4) Reflexive, symmetric and transitive
Sol. Answer (1)
2
R is reflexive as 1 + a × a = 1 + a > 0
R is symmetric because, if 1 + ab > 0  1 + ba > 0
But R is not transitive in all case
For example
 1  1 1  1
  R    as 1 +    > 0
2 3 2 3
 1  1
and    R (–4) as 1 +    (–4) > 0
3 3
 1 1
But   R (–4) is not possible as 1 + (–4) = –1 < 0
2 2
Hence, R is not transitive.
14. Let A = {1, 2, 3, 4, 5} and let B = A × A. Define the relation R on B as follows (a, b) R (c, d) if and only if ad = cb.
Then R is
(1) Reflexive only (2) Symmetric only (3) Transitive only (4) Equivalence
Sol. Answer (4)
a a
(1) (a, b) R (a, b) :  , hence R is reflexive
b b
a c
(2) (a, b) R (c, d) : 
b d
c a
(c, d) R (a, b) : 
d b
Hence, R is symmetric.
a c
(3) (a, b) R (c, d) :  … (i)
b d
c e
(c, d) R (d, f) :  … (ii)
d f
a e
By (i), (ii)  
b f
 (a, b) R (e, f), hence R is transitive.
Hence R is equivalence.
15. For real numbers x and y define a relation R, xRy iff |x| = |y|, the relation R is
(1) Reflexive only (2) Symmetric only (3) Transitive only (4) Equivalence only
Sol. Answer (4)
Reflexivity : Let x be an arbitrary element of R and x  R.
 |x| = |x|
 xR1x
Hence, R1 is reflexive.
Symmetric : Let (x, y)  R1.
If |x| = |y|
 |y| = |x|
 (y, x)  R1
Hence, R1 is symmetric.
Transitive : Let (x, y) and (y, z)  R.
 |x| = |y| and |y| = |z|
 |x| = |z|
 (x, z)  R1
Hence, R1 is transitive.
Thus, R is an equivalence relation.
16. Let R be the real line. Consider the following subset of the plane R × R. S = {(x, y) : y = x + 1 and
0 < x < 2}, T = {(x, y) : x – y is an integer}. Which one of the following is true?
(1) Neither S nor T is an equivalence relation on R
(2) Both S and T are equivalence relations on R
(3) S is an equivalence relation on R but T is not
(4) T is an equivalence relation on R but S is not
Sol. Answer (4)
Clearly, T is an equivalence relation i.e., reflexive, symmetric and transitive.
But for S = {(x, y) : y = x + 1}
∵ x  x + 1  (x, x)  S  S is not reflexive.
 S is not equivalence relation.
17. Let W denotes the set of words in the English dictionary. Define the relation R = {(x, y)  W × W the words
x and y have at least one letter in common}, then R is
(1) Reflexive, not symmetric and transitive (2) Not reflexive, symmetric and transitive
(3) Reflexive, symmetric and not transitive (4) Reflexive, symmetric and transitive
Sol. Answer (3)
R is reflexive as x and x have at least one letter common
R is symmetric as if x and y have at least one letter common then y and x have at least one letter common
But R is not transitive
Let x = ABC
y = BCD
z = DEF
Here x R y, y R z, but x R z not possible.
Functions (Domain)
1
18. Let f ( x ) 
x  [x]
g  x   ln{ x }  ln[ x ]
 x 2  2x  3 
h  x   log(0.5  x )  2  , where {x}, [x] represent fractional function and greatest integer function then
 4x  4x  3 
 1 1  1  3 
(1) The domain of f(x) is R – Z+ (2) The domain of h(x) is   ,    , 1   ,  
 2 2 2  2 
+
(3) The domain of g(x) is R (4) The domain of g(x) is R
Sol. Answer (2)
{x} = 0 if x  I hence {x}{x} will not be defined at any integer [x] = 0 if x  [0, 1) hence [x][x] will not be defined
in [0, 1), hence domain of f(x) = { x } { x }  [ x ][ x ] will be R  {I  (0, 1)} .
 x 2  2 x 3 
log( x  0.5 )  2 
 4 x  4 x 3 
h( x )  ( x  0.5)
 x 2  2x  3  + + +
For log(0.5  x )  2  to be defined. – –
 4x  4x  3  –3 –1/2 1 3/2
x 2  2x  3
0
4x 2  4x  3
( x  3)( x  1)
0
 1  3
 x  2   x  2 
And (0.5 + x) > 0 and x + 0.5  1
1
x x  0.5
2
 1 1  1   3 
Hence domain   ,    , 1   ,   
 2 2  2   2 
g ( x )  ln{ x }  ln[ x ]
In{ x }  In[ x ]  0
ln{ x }  ln[ x ]
{x}  [x]
 x  ( , 1)
For logarithm to defined { x }  0  x   0
 x R x  [1, )
Hence no common domain, hence domain is null set.
19. The solution set for [x] {x} = 1 [where {x} and [x] are respectively fractional part and greatest integer function.] is
(1) R+ – (0, 1) (2) R+ – {1}
 1   1 
(3)  m  | m  I  {0}  (4) m  | m  N  {1} 
 m   m 
Sol. Answer (4)
1
[x] 
{x}
x  I therefore if x  I, { x }  0 hence A and B options are wrong.
1 1
∵ { x }  [0, 1) {x}   If {x} gives
[x] m
1 1
  (1, )  { x }  , m I [x] gives m.
{x} m
1
If x m , m I
m
 1
 [ x]  m    m
 m 
 1 1
{ x }  m   
 m m
 1 1  1 
 m  m    1 
but m  0  x  m  m N  {1}
m
   
m  
 m
20. Domain of the function

1
 7 
f ( x )  (5 x  6  x 2 )[ln { x } 4 ]  7 x  5  2 x 2   ln   x  
  2 
{·} represents fractional part function and [.] represents G.I.F.
 5  5
(1) R (2) 1, (3) (1, 2) (4) (1, 2)   2, 
 2   2
Sol. Answer (4)
1
 7 
f ( x )  (5 x  6  x 2 )[{ln{ x }}]  7 x  5  2 x 2   ln   x  
 2 
For log to be defined {x}  0
 x I
7 x  5  2x 2  0
 5
( x  1)  x    0
 2
+ +
–
1 5/2
 5
x  1, 
 2
7 
ln   x   0 being in denominator,
2 
7
x 1
2
5
x
2
7
Also, x0
2
7
x
2
 5
Domain (1, 2)   2,   p1/4
 2   where p  {2, 3, …….., 38, 39}
21. If f(x) is defined on (0, 1), the domain of definition of f(ex) + f(ln|x|) is
(1) (0, 1) (2) R (3) (–e, –1) (4) (–e, e) – [–1, 1]
Sol. Answer (3)
∵ f ( x ) is defined from (0, 1)  x  (0, 1) for f (e x ) to be defined 0  e x  1    x  0

f (ln | x |) to define 0 < ln |x| < 1
 e0  | x |  e1
 1 | x |  e
 x  ( e,  1)  (1, e )
Hence domain of given function will be ( e, 1)
22. The domain of function f(x) = log3 ( (log3 x )2  5(log3 x )  6) is

(1) (9, 27) (2) [9, 27] (3) (0, 9)  (27, ) (4) (0, 9]  [27, )
Sol. Answer (1)
f ( x )  log3 ( (log3 x )2  5(log3 x )  6)
(log3 x )2  5(log3 x )  6  0
(log3 x )2  5(log3 x )  6  0
(log3 x  2)(log3 x  3)  0
2  log3 x  3
9  x  27
23. If domain of y = f(x) is [–4, 3], then domain of g(x) = f(|[x]|) is, where [.] denotes greatest integer function
(1) (–3, 4) (2) [–3, 4) (3) [–5, 3] (4) [–4, 3]
Sol. Answer (2)
By given condition, –4  |[x]|  3
 0  |[x]|  3
 –3  [x]  3
 –3  x < 4
 Domain of g(x) is [–3, 4).
9
24. Domain of definition of the function f ( x )   log10 ( x 3  x ), is
9  x2
(1) (–1, 0)  (1, ) (2) (1, 3)  (3, )
(3) (–1, 0)  (1, 3)  (3, ) (4) (–1, 0)  (3, )
Sol. Answer (3)
9
f (x)   log10 ( x 3  x )
9  x2
f(x) is real if 9 – x2  0 and x3 – x > 0
 x  ± 3 and x(x – 1)(x + 1) > 0
 x  ±3 and x  (–1, 0)  (1, )
 Domain of f(x) is (–1, 0)  (1, 3)  (3, )
Range
25. Range of function f(x) = cos(k sin x) is [–1, 1], then the least positive integral value of k will be
(1) 1 (2) 2 (3) 3 (4) 4
Sol. Answer (4)
∵ 1  sin x  1
k  k sin x   k
For cos  to show complete range its domain should be [0, ] or [–, 0]
Hence k = 
Hence minimum integral value is k = 4
x x+1
26. If f(x) = 4 – 2 + 5, then range of f(x) is
(1) R (2) [5, ) (3) [4, ) (4) [0, )
Sol. Answer (3)
f ( x )  4 x  2x 1  5  (2x )2  2.2x  5
= (2x  1)2  4
∵ (2x  1)2  0
f ( x )  (2x  1)2  4  4 . Hence range [4, ).
27. Range of the function f ( x )  log0.5 (3 x  x 2  2)
(1) (–, 2] (2) [2,   ) (3) R (4) R – (2)
Sol. Answer (2)
[3/2, 1/4]
(1, 0) (2, 0)
f ( x )  log0.5 (3 x  x 2  2)
Domain is 1 < x < 2

 If 1 < x < 2
1
0  3x  x2  2 
4
  ln1/2 (3 x  x 2  2)  2
 Range [2, )
28. Let f(x) = [x]2 + [x + 1] – 3, where [.] denotes the greatest integer function. Then
(1) f(x)  0 for all real values of x (2) f(x) = 0 for only two real value of x
(3) f(x) = 0 for infinite values of x (4) f(x) = 0 for no real value of x.
Sol. Answer (3)
f ( x )  [ x ]2  [ x  1]  3  0
[ x ]2  [ x ]  1  3  0
[ x ]2  [ x ]  2  0
{[ x ]  2} {[ x ]  1}  0
 [x] = –2, [x] = 1
 x  [ 2,  1)  [1, 2) . Hence f ( x )  0 for infinite values of x.
29. The range of the function f(x) = cos2x – 5cosx – 9 is

(1) [–13, 3] (2) [0, 3] (3) [–13, –3] (4) [–13, –9]
Sol. Answer (3)
f(x) = cos2x – 5cosx – 9
 25  25
  cos2 x  5cos x   9
 4 4
2
 5 61
  cos x    …(i)
 2 4
2
9  5 49
where   cos x    ...(ii)
4  2  4
 from (i) and (ii) –13  f(x)  –3
 Range of f(x)  [–13, –3]
Mapping
30. The number of Surjections from A = {1, 2, ..... n}, n  2, onto B = {a, b} is
n
(1) P2 (2) 2n – 2 (3) 2n – 1 (4) 2n
Sol. Answer (2)
The number of Surjections = 2n  2 C1.1n  2n  2
31. The total number of injective mappings from a set with m elements to a set with n elements, m  n, is
n!
(1) mn (2) nm (3) (4) n!
(n  m )!
Sol. Answer (3)
n!
The total number of injective mappings = n Pm =
(n  m)!
 3
32. Function f :  ,   [ 1, 1], f ( x )  sin x is
2 2 
(1) Many-one onto (2) Onto (3) One-one onto (4) Many-one into
Sol. Answer (3)
  3 
Function f :  ,   [ 1, 1], f ( x )  sin x
2 2 
Obviously it is One-one onto function.
x2
33. If f : [0, ) [0, ) and f(x) = , then f is
1 x 4
(1) One-one and onto (2) One-one but not onto
(3) Onto but not one-one (4) Neither one-one nor onto.
Sol. Answer (4)
Clearly, function is neither one-one nor onto.
34. If f1(x) = 2x + 3, f2(x) = 3x3 + 5, f3(x) = x + cosx are defined from R  R, then f1, f2 and f3 are
(1) One-one-onto (2) Many one into (3) One-one-into (4) Many one onto
Sol. Answer (1)
f3 ( x )  x  cos x
f3( x )  1  sin x  0

 f3( x )  0 hold for only point x = (2n  1) , n  I i.e. at discrete points not in interval hence function is
2
strictly increasing. Hence function is one-one and onto.
Similarly we can prove for f1, f2.
35. Which of the following is an onto function?
(1) f(x) = x6 + x4 + x2 + 1, f : R  R
[–1, 1]  [–1, 1]
2
(2) f(x) = x |x|, on [–1, 1]
(3) y = x 11
– x + x + 5 on (–, )
8 6
RR
(4) y = x 2006
+x –2006
+ 5 on (–, ) RR
Sol. Answer (3)
(1) y = x6 + x4 + x2 + 1 = (1 + x2) (1 + x4)
 y  1 hence it is not onto
2
(2) f(x) = x |x|, range = [0, 1]
Hence not onto.
(3) y = x11 – x8 + x6 + 5
y  R hence it is onto
(4) y = x2006 + x–2006 + 5
y  7 hence it is not onto
36. If a function f : R  R is defined by f(x) = x + 4x + cx + d, where c, d  R, if f(x) is one-one onto, then c may be
3 2
(1) 6 (2) 4 (3) 0 (4) –1

Sol. Answer (1)
f(x) = x 3 + 4x 2 + cx + d is one-one.
 f(x) will be either > 0 or < 0
f(x) = 3x 2 + 8x + c
Hence, its discriminant D < 0
2
8 – 4(3)(c) < 0
16
 c
3
Hence, c can take value 6.
37. Let A = {1, 2, 3}, B = {a, b, c}, C = {a1, b1, c1, d1, e1} and consider the following statements
S1 :The number of one-one functions from A to C is 60
S2 :The number of onto functions from C to A is 150
S3 :The number of onto functions from B to C is zero
S4 : The number of bijective functions from A to B is 6
Which of the following combinations is true?
(1) S1 and S2 only (2) S1 and S3 only (3) S2 and S4 only (4) S1, S2, S3 and S4
Sol. Answer (4)
All statements are true by using the standard result.
38. Which of the followings is not true?
(1) f : R  R, f(x) = x3 + x2 + 3x + sinx is bijective
(2) f(x) = x3 + (a + 2)x2 + 3ax + 5 is one-one then a  (1, 4)
(3) f(x) = ax + 3sinx + 4cosx is injective then a  (–, –5]  [5, )
(4) f(x) = 2x3 + 6x2 + 12x + asinx + bcosx is injective then the maximum value of a2 + b2 is 5
Sol. Answer (4)
f(x) = x3 + x2 + 3x + sin x
2
 1 8
f (x) = 3x2 + 2x + 3 + cos x = 3  x     cos x > 0
3 3
 f (x) > 0,  x  R
Hence f(x) is one-one and onto.
Similarly (2), (3) are true but (4) is false. The maximum value of a2 + b2 is 36.
39. Let S be the set of all triangles and R+ be the set of positive real numbers, then the function
f : S  R , f() = Perimeter of  S, then 'f ' is
+
(1) Injective but not surjective (2) Surjective but not injective
(3) Injective as well as surjective (4) Neither injective nor surjective
Sol. Answer (2)
Since many triangles may have same perimeter hence function is not injective but many one.
Since there exist a triangle for every positive value of perimeter hence surjective.
Composition of Functions
40. Let f(x) = [x] and g(x) = x – [x], then which of the following functions is the zero function ?
(1) (f + g) (x) (2) (fg) (x) (3) (f – g) (x) (4) (fog) (x)
Sol. Answer (4)
Here f  g  x    f  x   x   f   x     x    0 , where {.} represents fractional part function.
1
41. Given f ( x )  , g ( x )  f {f ( x )} and h( x )  f {f {f ( x )}} , then the value of f ( x ).g ( x ).h( x ) is
(1  x )
(1) 0 (2) –1 (3) 1 (4) 2
Sol. Answer (2)
1 1 x 1
Here, f ( x )  , g ( x )  f {f ( x )} = 
(1  x ) 1 x
1
1 x
1
and h( x )  f {f {f ( x )} =  x,
 x  1
1 
 x 
So, f ( x ).g ( x ).h( x ) = –1.
Inverse of Functions
42. Let A = {1, 2, 3}. Which of the following functions on A is invertible ?

(1) f  1,1 ,  2,1 ,  3,1 (2) f  1,2  ,  2,3  ,  3,1
(3) f  1,2  ,  2,3  ,  3,2  (4) f  1,1 ,  2,2  ,  3,1

Sol. Answer (2)
As, only option (2) is one-one onto function. So this is invertible.
43. Let f : R  R, g : R  R be two functions given by f(x) = 2x – 3, g(x) = x3 + 5. Then (fog)–1 (x) is equal to
1/3 1/3 1/3 1/3
 x 7  7  x 2  x 7
(1)   (2) x  2 (3)  7  (4)  2 
 2       
Sol. Answer (4)
   
As, f  g  x    f x  5  2 x  5  3  2 x  7
3 3 3
1/3
 x  7
So, its inverse is given by 
 2 
.
1
44. If f : [1, )  [2, ) is given by f(x) = x + x , then f–1 (x) equals:
x  x2  4 x x  x2  4
(1) (2) (3) (4) 1 x2  4
2 1 x2 2
Sol. Answer (1)
1
Let f  x   z  f  z   x  z 
1
 x  z 2  xz  1  0
z
x  x2  4
So, z  .
2
45. Select the correct option.
(1) f : [1, )  [1, ), f(x) = 2x(x – 1)
1
 f 1( x )  (1  1  4log2 x )
2
(2) f : [–1, ]  [–1, ], f(x) = (x + 1)2 – 1 and
f(x) = f–1(x) then x = {0, 1} only
1 x 5
(3) f : R  R, f(x) = 3x + 5 then f ( x ) 
3
(4) f : (0, )  (0, ), f ( x )  5loge x , then f 1( x )  x loge 5
Sol. Answer (3)

We have
x(x  1)
y = f(x) = 2
 x2 – x + log2y = 0
1  1  4 log2 y
 x
2
Since the range of inverse function is [1,) hence neglecting negative sign, we get
1  1  4 log2 x
f–1(x) =
2
Similarly (2), (4) are false but (3) is true.
x
46. Let f : [2, 4)  [1, 3) be a function defined by f(x) = x    (where [.] denotes the greatest integer function).
2
Then f–1 equals
x
(1) x (2) x+1 (3) x  (4) x+2
2
Sol. Answer (2)
We have,
2  x 4
x x
 1  2    = 1 or 2.
2 2
 f(x) = x – 1 or f(x) = x – 2
Since f : [2, 4)  [1, 3)
Hence f(x) = x – 1
 f–1(x) = x + 1.
Odd and Even Functions

47. Which of the following function is an even function?
(1) f ( x )  1  x 3  1  x 3 (2) f ( x )  x | x |  x 2 sin x
 2  sin x 
(3) f ( x )  1  x 3  1  x 3 (4) f ( x )  log  
 2  sin x 
Sol. Answer (3)
For a function to be even,
f(x) = f(–x)
Only option (3) satisfies this condition.
48. Select the correct option

(1) f(x) = e3 – 2x . tan2x + |x| – tanx is an even function
(2) f(x) = h(x) + h(–x) + x2cot x is an even function
 x, x Q
(3) f  x    is an odd function
 x x Q
(4) f(x) = g(x) + g(–x) + |sgn(x)| is neither even nor odd function
Sol. Answer (3)
Option (2) f(x) is neither even nor odd
Option (3) f(x) is odd
Option (4) f(x) is even
 2 x
 x sin , |x|1
49. If f ( x )   2 , then f(x) is
 x | x | , |x|1
(1) Even function (2) Odd function (3) Periodic function (4) Neither even nor odd
Sol. Answer (2)
We have,
 2 x
 x sin 2 , 1  x  1

f (x)   x 2 , x 1
 2
 x , x 1

Clearly f(x) is odd.
Periodic Function
50. If f(x + 10) + f(x + 4) = 0, there f(x) is a periodic function with period
(1) 2 (2) 4 (3) 6 (4) 12
Sol. Answer (4)

Given f(x + 10) + f(x + 4) = 0
Replacing x by x + 2, we get
f(x + 12) + f(x + 6) = 0 ...(i)
again, replacing x by x – 4, we get
f(x + 6) + f(x) = 0 ...(ii)
solving (i) and (ii), we get
f(x + 12) = f(x)
Linear Functional Equations

51. Let f(x + y) + f(x – y) = 2f(x)f(y) for all x, y  R and f(0)  0. Then f(x ) must be
(1) One-one function (2) Onto function (3) Even function (4) Odd function
Sol. Answer (3)
f(x + y) + f(x – y) = 2f(x) f(y)
x = 0, y= 0
2
f(0) + f(0) = 2f(0)
 f(0) = 1 as f(0)  0
Put y = x and x = 0
f(x) + f(–x) = 2f(0) f(x)
 f(x) + f(–x) = 2 f(x)
 f(x) = f(–x)
Hence the given function f is even.
52. Let g(x) be a polynomial function satisfying g(x ).g(y ) = g(x ) + g(y) + g(xy) – 2 for all x, y  R and g(1)  1. If
g(3) = 10 then g(5) equals
(1) –24 (2) 16 (3) 26 (4) 34
Sol. Answer (3)
We have,
g(x). g(y) = g(x) + g(y) + g(xy) –2
Let us put x = y = 1
 g(1)2 = 3g(1) – 2
 g(1)2 – 3g(1) + 2 = 0
 g(1) = 2 as g(1)  1
1
Put y =
x
 1  1
g(x).g   = g(x) + g   + g(1) – 2
x x
 1  1
 g(x).g   = g(x) + g  
x x
 g(x) = ± xn + 1
 g(3) = x + 1 = 3 + 1 = 3 + 1
n n 2
 n = 2 and g(x) = x2 + 1
 g(5) = 5 + 1 = 25 + 1 = 26
2
n
53. If f : R  R satisfies, f(x + y) = f(x) + f(y),  x, y  R and f(1) = 4, then  f (r ) is
r 1
n(n  1)
(1) (2) n(n + 1) (3) 2n(n + 1) (4) 4n(n + 1)
2
Sol. Answer (3)
f(x + y) = f(x) + f(y)
Putting x = y = 1, f(2) = 2f(1)
Putting x = 2, y = 1, f(3) = f(2) + f(1) = 3f(1)
In general, f(n) = nf(1)
  f (r )  (1  2  3  ......  n )f (1)
r 1
n(n  1)
 f (1)
2
n(n  1)
 .4  2n(n  1)
2
n
54. If f(x) = a(x + 3); f(1) = 12, f(3) = 36; then f(2) is equal to
(1) 21 (2) 18 (3) 24 (4) 27
Sol. Answer (1)
f(1) = 12  12 = a(1 + 3)  a = 3
f(3) = 36  36 = 3(3n + 3)  n = 2
 f(x) = 3(x2 + 3)
and f(2) = 3(4 + 3) = 21
 1  1  1 1
55. If f  x    f  x    2f ( x ).f   for all x, y  R – {0} and f (0)  , then f(4) is
 y  y y 2
(1) 0 (2) 4 (3) –4 (4) 2

Sol. Answer (1)
At x = 0,
 1  1  1
f    f    2f (0)f  
y  y y
 1 1
 f    0 since f(0) =
 y 2
1
at y  , f (4)  0
4
56. A real valued function f(x) satisfies the functional equation f(x – y) = f(x)f(y) – f(a – x) f(a + y), where a is a
given constant and f(0) = 1, f(2a – x) =
(1) –f(x) (2) f(x) (3) f(a – x) (4) f(–x)
Sol. Answer (1)
Putting x = y = 0, then x = a , y = x – a
Now, f(x – y) = f(x)f(y) – f(a – x)f(a + y) ...(i)
f(0) = [f(0)] – [f(a)]  f(a) = 0, ∵ f(0) = 1

2 2
Again, f(2a – x) = f[a – (x – a)]
= f(a)f(x – a) – f(a – a)f(a + x – a)
= 0 – f(x) f(2a – x) = –f(x)

Binary Operations
57. Let ‘ * ’ be the binary operation defined on the set Z of all integers as a * b = a + b + 1 for all a, b  Z. The identity
element w.r.t this operation is
(1) –1 (2) –2 (3) 1 (4) 0
Sol. Answer (1)
If e’ is the identity element under ‘ * ’ then
a * e  e * a  a for all a  Z
 a  e  1  e  a  1  a
e+1=0
 e = –1.
58. The binary operation ‘ * ’ defined on the set of integers as a * b = a  b  1 is
(1) Commutative (2) Associative (3) Non-associative (4) Non-commutative

Sol. Answer (1)
Here, b * a | b  a | 1 |  1 a  b  | 1   1 a  b  1  1 a  b  1 | a  b | 1  a * b
 ‘ * ’ is commutative.
59. If A  a, b , then the number of binary operations that can be defined on A is
(1) 4 (2) 2 (3) 16 (4) 1

Sol. Answer (3)
Here, O(A) = 2. Hence, O ( A × A ) = 2 × 2 = 4. Number of binary operations on A is same as the number
of relations that can be defined from A × A to A.
Hence, number of binary operations on A = 24 = 16.
(∵ Any ordered pair of A × A can be associated to any one of the two elements of A)
60. Let A be the set of all real numbers except –1 and an operation ‘o’ be defined on A by aob = a + b + ab for all a,
b  A, then identity element w.r.t ‘o’ is
(1) a (2) b (3) 1 (4) 0
Sol. Answer (4)
If e is the identity element w.r.t. ‘o‘, then aoe  eoa  a for all a  1 .
 a  e  ae  a
 e 1  a  0
 e=0
Miscellaneous
61. If the function f(x) = [4.8 + a sinx] (where [.] denotes the greatest integer function) is an even function then
a belongs to
(1) (–0.8, 0.2) (2) (–0.8, 0.8) (3) (–0.2, 0.2) (4) (0, 0.2)
Sol. Answer (3)

According to question
Function is an even function if a  ( 0.2,0.2)
f (x)
62. Let a real valued function f satisfy f(x + y) = f(x) f(y)  x, y R and f(0)  0 Then g(x) = is
1  [f ( x )]2
(1) An even function (2) An odd function
(3) Neither even nor odd function (4) Periodic function
Sol. Answer (1)
f ( x  y )  f ( x ).f ( y ), x, y R
 f ( x )  a kx , a  0
a kx
g( x ) 
1  a 2kx
a  kx a kx
g( x )  2kx

1 a 1  a 2kx
Hence g(x) is even function.
63. The graph of the function y = f(x) is symmetrical about x = 5, then
(1) f(x + 5) = f(x – 5) (2) f(5 + x) = f(5 – x) (3) f(x) = f(–x) (4) f(x) = –f(–x)
Sol. Answer (2)
If the graph is symmetrical about x = 5 then f(5 – t) = f(5 + t)
 f(5 + x) = f(5 – x)


CLS JEEAD-19-20 XII Mat Target-1 Level-1 Chapter-1 PDF

Uploaded by

Copyright:

Available Formats

You might also like

CLS JEEAD-19-20 XII Mat Target-1 Level-1 Chapter-1 PDF

Uploaded by

Document Information

Original Description:

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

CLS JEEAD-19-20 XII Mat Target-1 Level-1 Chapter-1 PDF

Uploaded by

Copyright:

Available Formats

Level-I

Relations and Functions

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

 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.

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).

Sol. If b is inverse of a, then

Short Answer Type Questions :

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

13. Let f : R  R be defined by f(x) = 7x – 3. Show that f is invertible, find f–1.

Since a  b in general, therefore a * b  b * a

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.

 f(x) = (3x2 + 2x + 3) + cosx

Also, range of f(x) is R = co-domain.

So, f(x) is onto function.

Hence, f(x) is bijective.

 [(x + 1)2 – 1 + 1]2 –1 = x

So, set of values of x is {0, –1}.

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

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

23. 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

Long Answer Type Questions :

So, the relation R is symmetric

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

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

Relations and Functions

(1) Reflexive (2) Symmetric (3) Transitive (4) Equivalence

2. Let A = {1, 2, 3, 4}. Which of the following is an equivalence relation of A?

Sol. Answer (4)

(1)  (2) {2, 4, 7} (3) {3, 5, 8} (4) {3}

(1) 8 (2) 0 (3) 16 (4) 32

R2–1 o R1 = {(1, 3)}

Then which of the following is true?

(1) R1, R2 and R3 are equivalence (2) R1 is equivalence

Sol. Answer (2)

9. Let R be a relation on A = {a, b, c} such that

Sol. Answer (4)

10. Consider the following statements on a set

Thus, R is an equivalence relation.

(1) Neither S nor T is an equivalence relation on R

(2) Both S and T are equivalence relations on R

(3) S is an equivalence relation on R but T is not

(4) T is an equivalence relation on R but S is not

Sol. Answer (4)

Clearly, T is an equivalence relation i.e., reflexive, symmetric and transitive.

But for S = {(x, y) : y = x + 1}

∵ x  x + 1  (x, x)  S  S is not reflexive.

 S is not equivalence relation.

in [0, 1), hence domain of f(x) = { x } { x }  [ x ][ x ] will be R  {I  (0, 1)} .

And (0.5 + x) > 0 and x + 0.5  1

x  I therefore if x  I, { x }  0 hence A and B options are wrong.

20. Domain of the function

∵ f ( x ) is defined from (0, 1)  x  (0, 1) for f (e x ) to be defined 0  e x  1    x  0