Relations and

01 Functions
1.1 Introduction 1.4 Composition of Functions and Invertible
1.2 Types of Relations Function

1.3 Types of Functions 1.5 Binary Operations

Topicwise Analysis of Last 10 Years’ CBSE Board Questions

8 Maximum weightage is of Composition of 8 Maximum SA & LA type questions were asked

Functions and Invertible Function from Composition of Functions and Invertible
Functions
8 Maximum VSA type Questions were asked from
Binary Operations 8 No VBQ type questions were asked till now

QUICK RECAP
RELATION Empty Relation
X If no element of A is related to any element of A.
8 A relation R from a set A to a set B is a subset of
A × B. So, we say R A × B. A relation from a Then relation R in A is called an empty relation
set A to itself is called a relation in A. i.e., R = A × A.
2 CBSE Chapterwise-Topicwise Mathematics

Universal Relation Composition of Functions

X If each element of A is related to every element X Let f : A B and g : B C be any two functions,
of A, then relation R in A is called universal then the function gof : A C defined as
relation i.e., R = A × A. gof(x) = g(f(x)), for all x A, is called the
8 A relation R in a set A is called composition of f and g.
(i) reflexive, if (a, a) R, for all a A Invertible Functions
(ii) symmetric, if (a, b) R (b, a) R, for X A function f : A B is said to be invertible,
all a, b A if there exists a function g : B A such that
(iii) transitive,if(a,b) R and (b,c) R (a,c) R, gof = IA and fog = IB. Here, g is called the inverse
for all a, b, c A
of f.
X A relation R in a set A is called an equivalence
X Also, f is an invertible function iff it is a bijective
relation, if it is reflexive, symmetric and
function.
transitive.
X In a relation R in a set A, the set of all elements BINARY OPERATIONS
related to any element a A is denoted by [a]
8 A function * on a set A i.e., * : A × A A is called
i.e., [a] = {x A : (x, a) R}
a binary operation i.e., a, b A a*b A
Here, [a] is called an equivalence class of
a A. X A binary operation * on a set A is
(i) commutative, if a * b = b * a, for all a, b A
FUNCTION (ii) associative, if (a * b) * c = a * (b * c),
8 A relation f from a set A to a set B is called a for all a, b, c A
function if (iii) distributive over another binary operation
(i) for each a A, there exists some b B ‘o’, if a * (b o c) = (a * b) o (a * c), for all
such that (a, b) f i.e., f(a) = b a, b, c A.
(ii) (a, b) f and (a, c) f b=c Identity element
X A function f : A B is called X An element e A is the identity element for
(i) one-one or injective function, if distinct binary operation * : A × A A, if
elements of A have distinct images i.e., for a * e = a = e * a, for all a A.
a, b A, f(a) = f(b) a = b
(ii) onto or surjective function, if for every Invertible element
element b B, there exists some a A X An element a A is the invertible element for
such that f(a) = b. binary operation * : A × A A, if there exists a
X A function f : A B is called bijective function, unique element b A such that a * b = e = b * a.
if it is both one-one and onto function. Here, b is called the inverse of a.
Relations and Functions 3

Previous Years’ CBSE

PREVIOUS Board
YEARS MCQS Questions

1.2 Types of Relations 10. Show that the relation R defined by (a, b) R (c, d)
a + d = b + c on the set N × N is an equivalence
VSA (1 mark) relation. (AI 2010, 2008)

1. If R = {(x, y) : x + 2y = 8} is a relation on N, 11. Let f : X Y be a function, define a relation R

write the range of R. (AI 2014) on X given by R = {(a, b) : f (a) = f (b)}. Show
that R is an equivalence relation on X.
2. Let R = {(a, a3) : a is a prime number less than 5}
(AI 2010 C)
be a relation. Find the range of R.
(Foreign 2014) 12. Prove that the relation R in the set A = {1, 2, 3, 4, 5}
given by R = {(a, b) : a – b is even}, is an
3. Let R be the equivalence relation in the set equivalence relation. (Delhi 2009)
A = {0, 1, 2, 3, 4, 5} given by
R = {(a, b) : 2 divides (a – b)}. Write the 13. Check whether the relation R defined in the
equivalence class [0]. (Delhi 2014 C) set {1, 2, 3, 4, 5, 6} as R = {(a, b) : b = a + 1} is
reflexive, symmetric or transitive. (AI 2007)
4. State the reason for the relation R in the set
{1, 2, 3} given by R = {(1, 2), (2, 1)} not to be LA (6 marks)
transitive. (Delhi 2011)
14. Let N denote the set of all natural numbers
SA (4 marks) and R be the relation on N × N defined by
(a, b) R(c, d) if ad(b + c) = bc(a + d). Show that
5. Let A = {1, 2, 3, ..., 9} and R be the relation in R is an equivalence relation. (Delhi 2015)
A × A defined by (a, b) R (c, d) if a + d = b + c
for (a, b), (c, d) in A × A. Prove that R is an 15. Show that the relation R in the set A = {1,2,3,4,5}
given by R {(a, b) : a – b is divisible by 2} is an
equivalence relation. Also obtain the equivalence
equivalence relation. Write all the equivalence
class [(2, 5)]. (Delhi 2014)
classes of R. (AI 2015 C)
6. Let R be a relation defined on the set of natural
numbers N as follow : 1.3 Types of Functions
R = {(x, y) x N, y N and 2x + y = 24}
VSA (1 mark)
Find the domain and range of the relation R.
Also, find if R is an equivalence relation or not. 16. Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let
(Delhi 2014 C) f = {(1, 4), (2, 5), (3, 6)} be a function from A to
B, state whether f is one-one or not. (AI 2011)
7. Show that the relation S in the set R of real
numbers defined as S = {(a, b) : a, b R and 17. What is the range of the function
a b3} is neither reflexive, nor symmetric, nor | x − 1|
f (x ) = ? (Delhi 2010)
transitive. (Delhi 2010) (x − 1)
8. Let Z be the set of all integers and R be the 18. State whether the function f : N N given by
relation on Z defined as R = {(a, b) : a, b Z f(x) = 5x is injective, surjective or both.
and (a – b) is divisible by 5}. Prove that R is an (AI 2008 C)
equivalence relation. (Delhi 2010)
SA (4 marks)
9. Show that the relation S in the set
A = {x Z : 0 x 12} given by 19. Show that f : N N, given by
S = {(a, b) : a, b Z, a – b is divisible by 4} is an x + 1, if x is odd
f (x ) =
equivalence relation. Find the set of all elements x − 1, if x is even
related to 1. (AI 2010) is both one-one and onto. (AI 2012)
4 CBSE Chapterwise-Topicwise Mathematics

20. Let f : N N be defined by 31. If f : R R is defined by

n +1 f(x) = x2 – 3x + 2, find f(f(x)). (AI 2007)
,if n is odd
f (n) = 2 for all n N
n SA (4 marks)
, if n is even
2 32. If the function f : R R be given by f(x)
Find whether the function f is bijective. = x + 2 and g : R
2
R b e g ive n by
(Delhi 2012 C, AI 2009) x
g(x) = , x 1, find fog and gof and hence
21. If f : R R be the function defined by x −1
f(x) = 4x3 + 7, show that f is a bijection. find fog (2) and gof (–3). (AI 2014)
(Delhi 2011 C) 33. Let f : W W, be defined as f(x) = x – 1, if x is
22. Show that the function f : W W defined by odd and f(x) = x + 1, if x is even. Show that f is
n + 1, if n is even invertible. Find the inverse of f, where W is the
f (n) = set of all whole numbers. (Foreign 2014)
n − 1, if n is odd
is a bijective function. (AI 2011 C) 34. Let A = R – {3}, B = R – {1}. Let f : A B be
x −2
defined by f(x) = , for all x A. Then
23. Show that the function f : R R given by x −3
f(x) = ax + b, where a, b R, a 0 is a bijective show that f is bijective. Hence find f–1(x).
function. (Delhi 2010 C) (Delhi 2014 C, 2012)
1.4 Composition of Functions and 35. Let f, g : R R be two functions defined as
f(x) = x + x and g(x) = x – x, for all x R. Then
Invertible Function find fog and gof. (AI 2014 C)
VSA (1 mark) 2
36. Show that the function f in A= R − defined
24. Let f : {1, 3, 4} {1, 2, 5} and g : {1, 2, 5} {1, 3} 3
4x + 3
given by f = {(1, 2), (3, 5), (4, 1)} and as f (x ) = is one-one and onto. Hence
6x − 4
g = {(1, 3), (2, 3), (5, 1)}. Write down gof.
find f –1. (Delhi 2013)
(AI 2014 C)
37. Consider f : R+ [4, ) given by f(x) = x2 + 4.
2x − 7 Show that f is invertible with the inverse f –1 of
25. If f : R R defined as f (x ) = is an
4 f given by f −1 (=
y) y − 4 , where R+ is the set
invertible function, write f –1(x).
(Delhi 2012 C, 2008 C) of all non-negative real numbers. (AI 2013)

26. If f : R R is defined by f(x) = (3 – x3)1/3, then 38. Let A = R – {2} and B = R – {1}. If f : A B is
find fof(x). (AI 2010) x −1
a function defined by f (x ) = , show that
x −2
27. If f : R R is defined by f (x) = 3x + 2, find
f is one-one and onto. Hence find f –1.
f (f (x)). (Delhi 2010 C)
(Delhi 2013 C)
28. If the function f : R R, defined by f (x) = 3x – 4,
39. Let A = R – {3} and B = R – {1}. Consider the
is invertible, find f – 1. (AI 2010C)
x −2
function f : A B defined by f (x ) = .
3x + 5 x −3
29. If f : R R defined by f (x ) = is an Is f one-one and onto ? Justify your answer.
2
invertible function, find f –1. (AI 2009 C) (AI 2012C)
40. Let f : R R be defined as f (x) = 10x + 7. Find
30. If f(x) = x + 7 and g(x) = x – 7, x R, the function g : R R such that gof = fog = IR.
find (fog) (7). (Delhi 2008) (AI 2011)
Relations and Functions 5

x+3 50. Let * be a binary operation on N given by

41. If the function f : R R is given by f (x ) = a * b = L.C.M. (a, b) for all a, b N. Find 5 * 7.
2
and g : R R is given by g(x) = 2x – 3. Find (Delhi 2012)
(i) fog and (ii) gof. Is f –1 = g? (Delhi 2009 C) 51. The binary operation * : R × R R, is defined
42. If f : R R and g : R R are defined as a * b = 2a + b. Find (2 * 3) * 4. (AI 2012)
respectively as f (x) = x 2 + 3x + 1 and 52. If the binary operation * on the set of integers
g(x) = 2x – 3. Find (a) fog (b) gof. Z, is defined by a * b = a + 3b2, then find the
(AI 2009 C, 2008) value of 8 * 3. (AI 2012 C)
43. If f be a greatest integer function and g be an 53. Let * be a binary operation defined on the set
absolute value function, find the value of of integers by a * b = 2a + b – 3. Find 3 * 4.
−3 4 (Delhi 2011 C, AI 2008)
( fog ) + ( gof ) . (Delhi 2007)
2 3
54. Let * be a binary operation defined by
LA (6 marks) a * b = 3a + 4b – 2. Find 4 * 5.
(AI 2011 C, Foreign 2008)
44. Let f : N N be a function defined as
f(x) = 9x2 + 6x – 5. Show that f : N S, where S 55. If the binary operation * on the set of integers
is the range of f, is invertible. Find the inverse of Z is defined by a * b = a + 3b2, then find the
f and hence find f –1(43) and f –1(163). value 2 * 4. (Delhi 2009)
(Delhi 2016)
56. Let * be a binary operation on N given by
45. If f, g : R R be two functions defined as a * b = H.C.F. (a, b); a, b N. Write the value
f(x) = x + x and g(x) = x – x, x R. Then of 22 * 4. (AI 2009)
find fog and gof. Hence find fog (–3), fog (5), and
gof (–2). (Foreign 2016) 57. Let * be a binary operation on set Q of rational
ab
46. Consider f : R+ [−9, [ given by numbers defined as a * b = , write the
5
f(x) = 5x2 + 6x – 9. Prove that f is invertible identity for *, if any. (Delhi 2009 C)
54 + 5 y − 3
with f −1 ( y ) = . (AI 2015) SA (4 marks)
5
58. Let S be the set of all rational numbers except 1
47. Let f : N R be a function defined as
and * be defined on S by a * b = a + b – ab, for
f(x) = 4x2 + 12x + 15. Show that f : N S, where
all a, b S.
S is the range of f, is invertible. Also find the
Prove that
inverse of f. (Foreign 2015, AI 2013 C)
(i) * is a binary operation on S.
1.5 Binary Operations (ii) * is commutative as well as associative.
(Delhi 2014 C)
VSA (1 mark)
59. Consider the binary operations * : R × R R
48. Let * be a binary operation on the set of all and o : R R R defined as a * b = |a – b| and
ab a o b = a for all, a, b R. Show that ‘ * ’ is
non-zero real numbers, given by a * b = for commutative but not associative, ‘o’ is associative
5
all a, b R – {0}. Find the value of x, given that but not commutative. (AI 2012)
2 * (x * 5) = 10. (Delhi 2014)
60. Consider the binary operation * on the set
49. Let * : R × R R, given by (a, b) a + 4b2 is {1, 2, 3, 4, 5} defined by a * b = min (a, b). Write
a binary operation. Compute (– 5) * (2 * 0). the operation table of the operation *.
(AI 2014 C) (Delhi 2011)
6 CBSE Chapterwise-Topicwise Mathematics

61. A binary operation * on the set {0, 1, 2, 3, 4, 5} 64. Let * be the binary operation on N given by
is defined as : a * b = L.C.M. of a and b. Find the value of
a + b , if a + b 6 20 * 16. Is * (i) commutative, (ii) associative ?
a*b =
a + b − 6 , if a + b 6
(AI 2008 C)
Show that zero is the identity for this operation
and each element a 0 of the set is invertible LA (6 marks)
with 6 – a being the inverse of a. (AI 2011)
65. Show that the binary operation * on A = R – {–1}
62. Let * be a binary operation on Q defined by
defined as a * b = a + b + ab for all a, b A is
3ab
a*b = . Show that * is commutative as well commutative and associative on A. Also find the
5
as associative. Also, find its identity element, if identity element of * in A and prove that every
it exists. (Delhi 2010) element of A is invertible. (AI 2016, 2015)

63. Let * be a binary operation on the set of rational 66. Let A = R × R and * be the binary operation on A
numbers given as a * b = (2a – b)2, a, b Q. defined by (a, b) * (c, d) = (a + c, b + d). Show
Find 3 * 5 and 5 * 3. Is 3 * 5 = 5 * 3 ? that * is commutative and associative. Find the
(Delhi 2008 C) identity element for * on A. (Delhi 2015 C)
Relations and Functions 7

Detailed Solutions

1. Here, R = {(x, y) : x + 2y = 8}, where x, y N. Thus, (a, b) R (c, d) and (c, d) R (e, f) (a, b) R (e, f).
For x = 1, 3, 5, ... So, R is transitive.
x + 2y = 8 has no solution in N. R is an equivalence relation.
For x = 2, we have 2 + 2y = 8 y = 3 Equivalence class for [(2, 5)] is {(1, 4), (2, 5), (3, 6),
For x = 4, we have 4 + 2y = 8 y = 2 (4, 7), (5, 8) (6, 9)}.
For x = 6 , we have 6 + 2y = 8 y = 1
For x = 8, 10, ... 6. Here, R = {(x, y) | x N, y N and 2x + y = 24}
x + 2y = 8 has no solution in N. Domain of R = {1, 2, 3, 4, ..., 11}
Range of R = {y : (x, y) R} = { 1, 2, 3} Range of R = {2, 4, 6, 8, 10, 12 ,..., 22}
2. Given relation is R is not reflexive as if (2, 2) R
R = {(a, a3) : a is a prime number less than 5}. 2 2 + 2 = 6 24
R = {(2, 8), (3, 27)} In fact R is neither symmetric nor transitive.
So, the range of R is {8, 27}. R is not an equivalence relation.
3. Here, R = {(a, b) A × A : 2 divides (a – b)} 7. We have S = {(a, b) : a b3} where a, b R.
This is the given equivalence relation, where 1 1
3
A = {0, 1, 2, 3, 4, 5} (i) Reflexive : We observe that, is not true.
[0] = {0, 2, 4}. 2 2
1 1
4. For transitivity of a relation, , S. So, S is not reflexive.
2 2
If (a, b) R and (b, c) R (a, c) R (ii) Symmetric : We observe that 1 33 but 3 13
We have, R = {(1, 2), (2, 1)} i.e., (1, 3) S but (3, 1) S. So, S is not symmetric.
(1, 2) R and (2, 1) R but (1, 1) R (iii) Transitive : We observe that, 10 33 and 3 23
R is not transitive.
but 10 23
5. Given A = {1, 2, 3, 4,...,9} N, the set of natural i.e., (10, 3) S and (3, 2) S but (10, 2) S
numbers. So, S is not transitive.
To show : R is an equivalence relation. S is neither reflexive, nor symmetric, nor
(i) Reflexivity : Let (a, b) be an arbitrary element of transitive.
A × A. Then, we have (a, b) A × A a, b A
a+b=b+a 8. We have R = {(a, b) : (a – b) is divisible by 5}
(by commutativity of addition on A N) (i) Reflexive : For any a Z,
(a, b) R (a, b) a – a = 0, which is a multiple of 5.
Thus, (a, b) R (a, b) for all (a, b) A × A (a, a) R
So, R is reflexive. Hence, R is reflexive.
(ii) Symmetry: Let (a, b), (c, d) A × A such that (ii) Symmetric : For any a, b Z, let (a, b) R
(a, b) R (c, d) a + d = b + c b + c = a + d (a – b) is a multiple of 5.
c+b=d+a (a – b) = 5m, m Z (b – a) = –5m
(by commutativity of addition on A N) (a, b) R (b, a) R
(c, d) R (a, b).
Hence, R is symmetric.
Thus, (a, b) R (c, d)
(iii) Transitive : For any a, b, c, Z, let (a, b) R and
(c, d) R (a, b) for all (a, b), (c, d) A × A.
So, R is symmetric. (b, c) R
(iii) Transitivity: Let (a, b), (c, d), (e, f) A × A such (a – b) = 5m and (b – c) = 5n; m, n Z
that (a, b) R (c, d) and (c, d) R (e, f) a – b + b – c = 5m + 5n; m, n Z
Now, (a, b) R (c, d) a + d = b + c ...(i) a – c = 5(m + n); m, n Z
and (c, d) R (e, f) c + f = d + e ...(ii) a – c is a multiple of 5.
Adding (i) and (ii), we get i.e., (a, b) R and (b, c) R (a, c) R
(a + d) + (c + f) = (b + c) + (d + e) Hence, R is transitive.
a+f=b+e (a, b) R (e, f) R is an equivalence relation.
8 CBSE Chapterwise-Topicwise Mathematics

9. We have, A = {x Z : 0 x 12} a – b is even and b – c is even

A = {0, 1, 2, 3, ..., 12} a – b = ± 2k1 and b – c = ± 2k2, for k1, k2 N
and S = {(a, b) : a – b is a multiple of 4} (a – b) + (b – c) = ± (2k1 + 2k2); k1, k2 N
(i) Reflexive : For any a A, a – c = ± 2(k1 + k2); k1, k2 N
a – a = 0 is a multiple of 4. a – c is even (a, c) R
Thus, (a, a) S Thus, (a, b) R and (b, c) R (a, c) R
S is reflexive. So, R is transitive.
(ii) Symmetric : For any a, b A, Hence, R is an equivalence relation.
Let (a, b) S
a – b is a multiple of 4 13. Here R = {(a, b) : b = a + 1}
b – a is a multiple of 4 (b, a) S = {(a, a + 1) : a, a + 1 {1, 2, 3, 4, 5, 6}}
i.e., (a, b) S (b, a) S = {(1, 2), (2, 3), (3, 4), (4, 5), (5, 6)}
S is symmetric. (i) R is not reflexive as (a, a) R a.
(iii) Transitive : For any a, b, c A, (ii) R is not symmetric as (1, 2) R but (2, 1) R.
Let (a, b) S and (b, c) S (iii) R is not transitive as (1, 2) R, (2, 3) R but
a – b is a multiple of 4 and b – c is a multiple of 4 (1, 3) R.
a – b = ± 4k1 and b – c = ± 4k2; k1, k2 N
14. (i) Reflexivity : Let (a, b) be an arbitrary
(a – b) + (b – c) = ± 4 (k1 + k2); k1, k2 N
a – c = ± 4 (k1 + k2); k1, k2 N element of N × N. Then, (a, b) N × N
a – c is a multiple of 4 (a , c) S ab(b + a) = ba(a + b)
S is transitive. [by commutativity of addition and multiplication on N]
Hence, S is an equivalence relation. (a, b) R (a, b)
The set of elements related to 1 is {5, 9}. So, R is reflexive on N N.
10. Refer to answer 5. (ii) Symmetry : Let (a, b), (c, d) N × N be such that
(a, b) R (c, d).
11. We have, f : X Y is a function
ad(b + c) = bc(a + d) cb(d + a) = da(c + b)
R = {(a, b) : f(a) = f(b)}
[by commutativity of addition and multiplication on N]
(i) Reflexivity : For any a X, we have
f(a) = f(a) (a, a) R R is reflexive. Thus, (a, b) R (c, d) (c, d) R (a, b) for all
(ii) Symmetric : For any a, b X, (a, b), (c, d) N × N.
Let (a, b) R f(a) = f(b) So, R is symmetric on N × N.
f(b) = f(a) (b, a) R (iii) Transitivity : Let (a, b), (c, d), (e, f) N × N
So, R is symmetric. be such that
(iii) Transitive : For any a, b, c X, (a, b) R (c, d) and (c, d) R (e, f). Then,
Let (a, b) R and (b, c) R (a, b) R (c, d) ad(b + c) = bc(a + d)
f(a) = f(b) and f(b) = f(c) b+c a+d 1 1 1 1
f(a) = f(c) (a, c) R = + = +
bc ad b c a d ...(i)
So, R is transitive.
Hence, R is an equivalence relation on X.
and (c, d) R (e, f) cf(d + e) = de(c + f)
12. We have A = {1, 2, 3, 4, 5} d +e c+ f 1 1 1 1
R = {(a, b) : a – b is even}; a, b A = + = + ...(ii)
de cf d e c f
(i) Reflexive : For any a A,
We have a – a = 0, which is even. Adding (i) and (ii), we get
(a, a) R a A 1 1 1 1 1 1 1 1
+ + + = + + +
So, R is reflexive. b c d e a d c f
(ii) Symmetric : For any a, b A,
1 1 1 1 b+e a+ f
Let (a, b) R a – b is even b – a is even + = + =
(b, a) R. b e a f be af
So, R is symmetric. af(b + e) = be(a + f) (a, b) R (e, f)
(iii) Transitive : For any a, b, c A. Let (a, b) R and So, R is transitive on N N.
(b, c) R Hence, R is an equivalence relation.
Relations and Functions 9

15. Refer to answer 9. 1 +1 2

Further R has only two equivalence classes, namely 20. (i) Injectivity : Here, f (1) == 1,= f (2) =1 ,
2 2
[1] = [3] = [5] = {1, 3, 5} and [2] = [4] = {2, 4}.
3 +1 4
16. A = {1, 2, 3}, B = {4, 5, 6, 7} and f (3) == 2= , f ( 4) =2
2 2
f = {(1, 4), (2, 5), (3, 6)}
(2k − 1) + 1 2k
We have, f(1) = 4, f(2) = 5 and f(3) = 6. Distinct Thus, f (2k − 1) = = k= and f (2k ) =k
elements of A have distinct images in B. Hence, f is a 2 2
one-one function. f(2k – 1) = f(2k), where k N
But, 2k – 1 2k, f is not one-one.
x − 1, x 1 Hence, f is not bijective.
17. We have, x − 1 =
1 − x, x 1 21. Here, f(x) = 4x3 + 7
1, x 1 Let x1, x2 R s.t.
x −1
f (x ) = = f(x1) = f(x2)
(x − 1) −1, x 1 4x13 + 7 = 4x23 + 7
Range (f ) = {– 1, 1} 4x13 = 4x23 x13 = x23
18. We have, f(x) = 5x x13 – x23 = 0
For x1, x2 N. (x1 – x2) (x12 + x1x2 + x22) = 0
Let f(x1) = f(x2) 5x1 = 5x2 x1 = x2 x1 – x2 = 0
The function is one-one. [Q x12 + x1x2 + x22 = 0 has no real roots]
Now, f(x) is not onto. Since, for 2 N (co-domain), x1 = x2
there does not exist any x N (domain) such that f : R R is one-one.
f(x) = 5x = 2 Again y R (co-domain), we find x R (domain)
f(x) is injective but not surjective. s.t. f(x) = y
4x3 + 7 = y 4x3 = y – 7
19. Here, f : N N s.t.
y −7 y −7
x + 1, if x is odd x3 = x= 3 R
f (x ) = 4 4
x − 1, if x is even (Q x3 = R has always one real root)
Let x, y N s.t. f(x) = f(y) Hence, f is onto
We shall show that x = y So, f : R R is a bijection.
(i) If x and y both are even 22. Refer to answer 19.
f(x) = f(y) x – 1 = y – 1 x = y
(ii) If x and y both are odd 23. We have f (x) = ax + b where a, b R and a 0
f(x) = f(y) x + 1 = y + 1 x = y (i) Injectivity : Let x1, x2 R such that f (x1) = f (x2)
(iii) If x is odd and y is even ax1 + b = ax2 + b x1 = x2
f(x) = f(y) x + 1 = y – 1 f(x) is one-one.
y–x=2 ...(1) (ii) Surjectivity : Let y R (co-domain) such that
R.H.S. is even but L.H.S. is odd. f(x) = y
Equation (1) in N is not possible. y −b
y = ax + b x= R (Q a 0)
(iii) does not arise. a
(iv) If x is even and y is odd, does not arise. y −b y −b
In any case, f(x) = f(y) x = y f =a +b= y
a a
f is one-one
f (x) is onto.
For any y N (co-domain), y can be even or odd
Hence, f is injective and surjective. So, f(x) is
When y is odd, y + 1 is even, so
bijective.
f(y + 1) = (y + 1) – 1 = y
When y is even, y – 1 is odd, so 24. Here, f = {(1,2), (3, 5), (4, 1)}
f(y – 1) = (y – 1) + 1 = y f(1) = 2; f(3) = 5; f(4) = 1 ...(1)
f : N N is onto. g = {(1, 3), (2, 3), (5, 1)}
Hence, f is both one-one and onto. g(1) = 3; g(2) = 3, g(5) = 1 ...(2)
 10 CBSE Chapterwise-Topicwise Mathematics

Now, gof : {1, 3, 4} {1, 3} 32. Here f : R R s.t. f(x) = x2 + 2

Using (1) and (2), we get x
(gof) (1) = g(f(1)) = g(2) = 3 and g : R R s.t. g (x ) = ,x 1
x −1
(gof) (3) = g(f(3)) = g(5) = 1 Now fog : R R s.t.
(gof) (4) = g(f(4)) = g(1) = 3 2
x x
gof = {(1, 3), (3, 1), (4, 3)}. =
( fog )(x ) f=
( g (x )) f = + 2, x 1
x −1 x −1
2x − 7 2
25. Let y = f(x) = 2
4 ( fog )(2) = +2=6
4y + 7 2 −1
4y = 2x – 7 x=
2 Also, gof : R R s.t.
As y = f(x) is an invertible function, so
x2 + 2
−1 4y + 7 =
( gof ( f (x )) g ( x 2 + 2) =
)( x ) g=
=x f= ( y ) i.e., f −1 ( y ) x2 + 1
2
4x + 7 (−3)2 + 2 11
f −1 : R R s.t. f −1 ( x ) = , x R. ( gof )(−3) = = .
2 (−3)2 + 1 10
26. f : R R and f(x) = (3 – x3)1/3 33. Refer to answer 19,
fof(x) = f(f(x)) = f [3 – x3)1/3] since f is bijective function. So, it is invertible.
Now, let x, y W such that f(x) = y
= [3 – {(3 – x3)1/3}3]1/3
x + 1 = y, if x is even and x – 1 = y, if x is odd.
= [3 – (3 – x3)]1/3 = (3 – 3 + x3)1/3 = x y − 1, if y is odd
27. We have, f(x) = 3x + 2 x=
y + 1, if y is even
f (f (x)) = f (3x + 2) = 3(3x + 2) + 2 = 9x + 8
y − 1, if y is odd
28. We have, f(x) = 3x – 4 f −1 ( y ) =
Let f(x) = y x = f –1(y) y + 1, if y is even
y+4 x − 1, if x is odd
y = 3x – 4 x= Hence, f −1 (x ) =
3 x + 1, if x is even
y+4 x+4
f −1 ( y ) = f −1 (x ) = 34. A = R – {3}; B = R – {1}
3 3 and f : A B defined as
3x + 5 x −2
29. We have, f (x ) = f (x ) = x A.
x −3
Let f(x) = y x = f (y)2 –1
Here, f is defined x A, as 3 A.
3x + 5 2y − 5 Also, f(x) 1
y= x=
2 3 x −2
2y − 5 [Q f(x) = 1 =1 x–2=x–3
f −1 ( y ) = x −3
3 – 2 = – 3, which is absurd]
2 x −5 Let x1, x2 A be such that f(x1) = f(x2)
f −1 (x ) = x1 − 2 x2 − 2
3 =
x1 − 3 x2 − 3
30. f(x) = x + 7 and g(x) = x – 7
(x1 – 2) (x2 – 3) = (x1 – 3) (x2 – 2)
So, fog (x) = f(g(x)) = f (x – 7) = x – 7 + 7 = x
fog (x) = x x1x2 – 3x1 – 2x2 + 6 = x1x2 – 2x1 – 3x2 + 6
fog (7) = 7 – 3x1 – 2x2 = – 2x1 – 3x2 x1 = x2
f is a one-one function.
31. f(f(x)) = f (x2 – 3x + 2) Let y B = R – {1} y 1.
= (x2 – 3x + 2)2 – 3 (x2 – 3x + 2) + 2 We want to solve y = f(x) for some x A
= x4 + 9x2 + 4 – 6x3 – 12x + 4x2 – 3x2 + 9x – 6 + 2
x −2
= x4 – 6x3 + 10x2 – 3x. y= xy – 3y = x – 2
x −3
Relations and Functions 11

x(y – 1) = –2 + 3y (ii) y = f (x) y [4, ), y 4

3y − 2 x2 + 4 = y x = y − 4
x= A (as y 1)
y −1 Now, x is defined if
f is onto also. y−4 0 y−4 R+ and
f : A B is a bijective function.
2
3y − 2 3x − 2 f y −=
4 y−4 +4=
( y − 4) + 4 = y
Now, f −1 ( y )= x= f −1 ( x ) =
y −1 x −1 f is onto.
35. Here, f, g : R R s.t. f is one–one and onto.
2 x if x 0 f is invertible and f –1 exists.
f (x ) = x + x =
0 if x 0 f –1 (y) = y − 4.
0 if x 0 x −1
and g (x ) = x − x = 38. Here, f : A B is given by f (x ) = ,
−2 x if x 0 x −2
where A = R – {2} and B = R – {1}
f (0) if x 0
(fog) (x) = f(g(x)) = Let f(x1) = f(x2), where x1, x2, A (i.e., x1 2, x2 2)
f (−2 x ) if x 0 x1 − 1 x2 − 1
=
0 if x 0 0 if x 0 x1 − 2 x2 − 2
= =
2(−2 x ) if x 0 −4 x if x 0 (x1 – 1) (x2 – 2) = (x1 – 2) (x2 – 1)
and (gof) (x) = g(f(x)) x1x2 – 2x1 – x2 + 2 = x1x2 – x1 – 2x2 + 2
g (2 x ) if x 0 0 if x 0 – 2x1 – x2 = – x1 – 2x2
= = = 0 x R. x1 = x2 f is one-one.
g (0) if x 0 0 if x 0
Next, let y B = R – {1} i.e., y R and y 1
4x + 3 2 x −1
36. Here, f (x ) = where x A =− R . Now, = y (x − 2) y = x −1
6x − 4 3 x −2
xy – 2y = x – 1 x(y– 1) = 2y – 1
(i) Let f(x1) = f(x2) ( x1, x2 A)
4 x1 + 3 4 x2 + 3 2y −1
= x= ...(i)
6 x1 − 4 6 x2 − 4 y −1
(4x1 + 3) (6x2 – 4) = (6x1 – 4) (4x2 + 3) 2y −1
f(x) = y when x = A (as y 1)
24x1x2 – 16x1 + 18x2 – 12 = 24x1x2 +18x1 – 16x2 – 12 y −1
–34x1 = – 34x2 x1 = x2 Hence, f is onto.
f is one-one. Thus, f is one–one and onto.
2 From (i), f –1 : B A is given by x = f–1 (y)
(ii) For y A =− R . 2y −1
3 i.e., f −1 ( y ) = .
Let f(x) = y y −1
4x + 3
= y (6 x − 4) y = 4x + 3 39. Refer to answer 34.
6x − 4
4y + 3 40. Let y R (co-domain) be arbitrary.
2
x= A as y By definition, y = 10x + 7 for x R
6y − 4 3 y −7
f is onto and f(x) = y x = f –1 (y) x=
4 y +3 4x + 3 10
f −1 ( y ) = y A f −1 (x ) = x A y −7
So, we define, g : R R by g ( y ) =
6y −4 6x − 4 10
This gives the inverse function of f. (10 x + 7) − 7
Now, (gof)
= (x) g=
( f (x )) g (10 x + 7) = = x and
37. f : R+ [4, ) given by f(x) = x + 4 2 10
(i) Let x1, x2 R+ s.t. f(x1) = f(x2) y −7 y −7
x12 + 4 = x22 + 4 x12 = x22 =
(fog) (y) f=
( g ( y )) f =10 +7=y
10 10
x1 = x2 (Q x1, x2 R+)
f is one-one Thus, gof = fog = IR.
12 CBSE Chapterwise-Topicwise Mathematics

2x − 3 + 3 2x and gof (x) = x R

41. (i) =
fog (x ) f=
( g (x )) = = x Now, fog (–3) = – 4 (–3) = 12
2 2
and fog (5) = 0, gof (–2) = 0
x+3
(ii) =gof (x ) g= ( f (x )) 2 −3 46. Here f : R+ [−9, [ as
2
= x + 3 – 3 = x. f(x) = 5x2 + 6x – 9
So, fog = gof = IR. Hence, f –1 = g. First we shall show that f is one-one.
Let f(x) = f(y), for x, y R+
42. (a) fog (x) = f (g(x)) = (2x – 3)2 + 3(2x – 3) + 1 5x2 + 6x – 9 = 5y2 + 6y – 9
= 4x2 – 12x + 9 + 6x – 9 + 1 = 4x2 – 6x + 1 5 (x2 – y2) + 6 (x – y) = 0
(b) gof (x) = g(f(x)) = 2(x2 + 3x + 1) – 3 (x – y) [5 (x + y) + 6] = 0
= 2x2 + 6x + 2 – 3 = 2x2 + 6x – 1 x=y [Q for x, y R+, 5 (x + y) + 6 0]
43. Here f(x) = [x] and g(x) = |x| f is one-one.
fog (x) = f(g(x)) = f(|x|) = [|x|] Let y [–9, [ be such that f(x) = y
−3 −3 3 5x2 + 6x – 9 = y 5x2 + 6x – (9 + y) = 0
( fog ) = = =1
2 2 2 −6 ± 62 + 4 5(9 + y ) −6 ± 216 + 20 y
x= =
gof (x) = g (f(x)) = g ([x]) = |[x]| 2 5 10
4 4 −3 ± 54 + 5 y
( gof ) = = | 1=| 1
3 3 =
5
−3 4 Taking only +ve sign (as for –ve sign, x R+)
( fog ) + ( gof ) = 1 + 1 = 2.
2 3 −3 + 54 + 5 y
We get x = R+ for which
44. Let f : N S, f(x) = 9x2 + 6x – 5 5
f(x) = y
Consider, f(x1) = f(x2) f is onto.
9x12 + 6x1 – 5 = 9x22 + 6x2 – 5 f is both one-one and onto.
9(x12 – x22) + 6(x1 – x2) = 0 f is invertible and f –1 is given by
(x1 – x2)[9x1 + 9x2 + 6] = 0
x1 = x2 [Q x1, x2 N] −3 + 54 + 5 y
f −1 ( y )= x=
f is one-one. 5
Since, S is the range of f.
f is onto. 47. Let f : N S, f(x) = 4x2 + 12x + 15
Since, f is one-one and onto. Consider, f(x1) = f(x2)
So, f is invertible. 4x12 + 12x1 + 15 = 4x22 + 12x2 + 15
Let y S be arbitrary number. 4(x12 – x22) + 12(x1 – x2) = 0
Consider, y = f(x) x = f –1(y) (x1 – x2) [4x1 + 4x2 + 12] = 0
y = 9x2 + 6x – 5 y = (3x + 1)2 + 6 x1 = x2 [Q x1, x2 N]
f is one-one
y + 6 −1
y +6 = 3x + 1 x= Since, S is the range of f.
3 f is onto.
−1 y + 6 − 1 −1 x + 6 −1 Since, f is one-one and onto.
Also, f ( y ) = or f (x ) = Therefore, f is invertible.
3 3
Let y S be arbitrary number such that f(x) = y
49 − 1 7 − 1
Now, f −1 (43) = = =2 y = 4x2 + 12x + 15
3 3 y = (2x + 3)2 + 6
169 − 1 13 − 1
and f −1 (163) = = =4 y −6 −3
3 3 y −6 = 2x + 3 x =
2
45. Refer to answer 34, Also, f(x) = y x = f –1 (y)
0, x 0
We get fog (x) = y −6 −3 x −6 −3
−4 x , x 0 f −1 ( y ) = or f −1 (x ) =
2 2
Relations and Functions 13

5x (ii) Let a, b S
48. We have, 2 * (x * 5) = 10 2* = 10 a * b = a + b –a b = b + a – b a = b * a * is commutative
5
in S
2x
2 * x = 10 = 10 x = 25 Let a,b,c S
5 Then a * (b * c) = a * (b + c – bc)
49. Here * : R × R R is given by = a + b + c – bc – a(b + c – bc)
a * b = a + 4b2. = a + b + c – ab – bc – ca + abc
(–5) * (2 * 0) = (–5) * (2 + 4.02) = – 5 * (2) = a + b – ab + c – (a + b – ab) c
= – 5 + 4.22 = – 5 + 16 = 11 = (a * b) * c
50. 5 * 7 = L.C.M. (5, 7) = 35. * is associative
51. * : R × R R given by 59. b * a = b – a = a – b [Q –x = x x R]
a * b = 2a + b = a * b a, b R
(2 * 3) * 4 = (2 × 2 + 3) * 4 = 2 × 7 + 4 = 18. * is commutative on R.
Also, for a = 2, b = 4, c = 5
52. Here a * b = a + 3b2 a, b Z
(a * b) * c = (2 * 4) * 5 = 2 – 4 * 5
8 * 3 = 8 + 3.32 = 8 + 27 = 35.
=2*5= 2–5 =3
53. Here a * b = 2a + b – 3 and a * (b * c) = 2 * (4 * 5) = 2 * 4 – 5
3 * 4 = 2(3) + 4 – 3 = 7 = 2 * 1 = 2 – 1 = 1.
54. Here a * b = 3a + 4b – 2 (a * b) * c a * (b * c)
4 * 5 = 3(4) + 4(5) – 2 = 12 + 20 – 2 = 30 * is not associative on R.
Also, (a o b) o c = a o c = a
55. Here a * b = a + 3b2 and a o (b o c) = a o b = a
2 * 4 = 2 + 3(4)2 = 2 + 3 × 16 = 50 (a o b) o c = a o (b o c) a, b, c R
56. Here a * b = H.C.F. (a, b) o is associative on R.
22 * 4 = H.C.F. (22, 4) = 2 Also, for a = 3, b = 2
aob=3o2=3
ab
57. Here a * b = . boa=2o3=2
5
aob boa
For identity, a * e = a = e * a o is not commutative on R.
ae ea e=5
= a= 60. Let A = {1, 2, 3, 4, 5}
5 5
a * b = minimum of a and b
Identity element for * is 5.
* 1 2 3 4 5
58. We have, S = Q – {1}
1 1 1 1 1 1
a * b = a + b – ab a, b S
2 1 2 2 2 2
(i) As a, b S a, b Q and a 1, b 1, ...(1)
3 1 2 3 3 3
a + b – ab Q
We check : a + b – ab 1 4 1 2 3 4 4
Suppose a + b – ab = 1 5 1 2 3 4 5
a + b – ab – 1 = 0 61. * 0 1 2 3 4 5
a – 1 + b (1 – a) = 0 0 0 1 2 3 4 5
–(1 – a) + b (1 – a) = 0 1 1 2 3 4 5 0
(1 – a) (– 1 + b) = 0 2 2 3 4 5 0 1
Either 1 – a = 0 or – 1 + b = 0
3 3 4 5 0 1 2
a = 1 or b = 1
4 4 5 0 1 2 3
This contradicts (1).
a + b – ab 1. 5 5 0 1 2 3 4
a + b – ab Q – {1} = S Identity : Let e be the identity element, then
* is binary operation on S. a*e=a=e*a
14 CBSE Chapterwise-Topicwise Mathematics

Now, a * 0 = a + 0 = a and 0 * a = 0 + a = a We have, a * b = a + b + ab = b + a + ba = b * a

Thus, a * 0 = a = 0 * a. Hence, 0 is the identity element Hence, * is commutative.
of the operation. Associativity : Let a, b, c R – {–1}
Inverse : Since, each row or column contains the We have, a * (b * c) = a * (b + c + bc)
identity element i.e., 0. = a + (b + c + bc) + a (b + c + bc)
So, each element is invertible.
= a + b + c + bc + ab + ac + abc
Now, a * (6 – a) = a + (6 – a) – 6 = 0
= a + b + ab + c + (a + b + ab) c
and (6 – a) * a = (6 – a) + a – 6 = 0.
Hence, each element a of the set is invertible with = (a + b + ab) * c = (a * b) * c
inverse 6 – a. Hence, * is associative.
Identity : Let e A be the identity element. Then,
3ab 3ba
62. Commutativity : a=
*b = = b*a a*e=a=e*a
5 5 a * e = a + e + ae = a and e * a = e + a + ea = a
* is commutative.
3ab 9abc e (1 + a) = 0 e = 0 [Q a –1]
Associativity : (a * b) * c = *c =
5 25 Hence, the identity element for * is e = 0.
Existence of inverse : Let a R – {–1} and b be the
3bc 9abc
and a * (b * c) = a * = inverse of a.
5 25
Then, a * b = e = b * a
(a * b) * c = a * (b * c) a + b + ab = 0 = b + a + ba
* is associative. a
Identity : a * e = a = e * a, where e is the identity b= −
element. a +1
3ae 3ea 5 Since, a R – {–1}
= a= e= Q −a
5 5 3 a −1 a +1 0 b= R
5 a +1
is the identity element.
3 a
Also, if − = −1
63. We have, a * b = (2a – b)2 a +1
3 * 5 = (2 × 3 – 5)2 = (6 – 5)2 = 1 –a = –a – 1 –1 = 0, which is not possible.
5 * 3 = (2 × 5 – 3)2 = (10 – 3)2 = 49 −a
Thus, 3 * 5 5 * 3 Hence, R − {−1}
a +1
64. We have, a * b = L.C.M. of a and b So, every element of R – {–1} is invertible and the
20 * 16 = L.C.M. of 20 and 16 = 80 −a
(i) Commutativity : a * b = L.C.M. of a and b inverse of an element a is .
a +1
= L.C.M. of b and a = b * a
a*b=b*a 66. Here A = R × R and * on A is defined as
So, * is commutative. (a, b) * (c, d) = (a + c, b + d) a, b , c, d , R
(ii) Associativity : (a * b) * c Now (c, d) * (a, b) = (c + a, d + b) = (a + c, b + d)
= [L.C.M. (a, b)] * c = (a, b) * (c, d) (a, b), (c, d) A
= L.C.M. [L.C.M. (a, b), c] * is commutative on A.
= L.C.M. (a, b, c) Again [(a, b) * (c, d)] * (e, f) = (a + c, b + d) * (e, f)
and a * (b * c) = a * [L.C.M. (b, c)] = a + c + e, b + d + f = a + (c + e), b + (d + f )
= L.C.M. [a, L.C.M. (b, c)] = (a, b) * (c + e, d + f)
= L.C.M. (a, b, c) = (a, b) * [(c, d) * (e, f)] (a, b), (c, d), (e, f) A
a * (b * c) = (a * b) * c
So, * is associative. * is associative on A.
Also 0 R and (0, 0) A.
65. We have a * b = a + b + ab ∀ a, b A, where (a, b) A, (a, b) * (0, 0) = (a + 0, b + 0) = (a, b)
A = R – {–1} and (0, 0) * (a, b) = (0 + a, 0 + b) = (a, b)
Commutativity : Let a, b R – {–1} (0, 0) acts as an identity element in A w.r.t. * .