Relations and Functions Cbse
Relations and Functions Cbse
1. Define Empty relation. 14. (i) Let f and g be two functions from R to R defined as
x | x | 0; x is rational
2. If f ( x ) , then find f (-1). f ( x)
|x| 1; x is irrational
3. If n(A) = p and n(B) = q, then find the number of 1; x is rational
and g ( x ) ,
relations from set A to set B. 0; x is irrational
4. A function is called an onto function, if its range is then find gof e fog .
equal to ________. 2x 1
5. A binary operation * on a set X is said to be ________, (ii) If f ( x) , then find the value of fof 2 .
3x 2
if a * b = b * a, where a, b ∈ X.
15. (i) If f (x) = e2x and g(x) = log x (x > 0), then find
fog (x).
Section–B (2 Marks Questions)
(ii) If f(x) = x2 + 1, then find fof(x).
6. The domain of the function f : R R defined by 16. Let f: R → R be the function defined by
1
2 f x ∀ x ∈ R. Then, find the range of f.
f x x 3 x 2 is ________. 2 cos x
7. Find the domain of the real valued function f defined by 17. Show that the binary operation * on Z defined by
a * b = 3a + 7b is not commutative.
f x 25 x .
2
18. Prove that the Greatest Integer Function f: R → R given
by f(x) = [x], is neither one-one nor onto, where [x]
8. Consider f: {1, 2, 3} → {a, b, c} given by f(1) = a, denotes the greatest integer less than or equal to x.
f(2) = b and f(3) = c. Find f-1 and show that (f--1)-1 = f. 19. Check whether the relation R defined in the set
9. Let R be the relation on N defined as xRy if x + 2y = 8. {1, 2, 3, 4, 5, 6} as R = {(a, b) : b = a - 1} is reflexive,
symmetric or transitive.
Find the domain of R.
20. Let n be a fixed positive integer. Define a relation R in Z
10. What is the range of the function as follows: ∀ a, b ∈ Z, aRb if and only if a – b is
divisible by n. Show that R is an equivalence relation.
| x 1 |
f x , x 1? 21. Let f, g and h be functions from R to R. Show that
x 1 (f + g)oh = foh + goh and (f.g)oh = (foh).(goh)
11. If f is an invertible function, defined 22. Check the injectivity and surjectivity of the following
functions:
3x 4 2
(i) f : N N given by f x x
1
as f ( x ) , then write f x .
5
2
(ii) f : Z Z given by f x x
12. If R = {(a, a3): a is a prime number less than 5} be a
23. If R is a relation defined on the set of natural numbers
relation. Find the range of R.
N as follows:
13. If A = {1, 2, 3}, B = {4, 5, 6, 7} and f = {(1, 4), (2, 5),
R x, y , x N , Y N and 2 x y 24 , then find
(3, 6)} is a function from A to B. State whether f is one-
the domain and range of the relation R . Also, find if
one or not. R is an equivalence relation or not.
2
24. If the function f : R R is given by f x x 2
x
and g : R R is given by g x ; x 1, then
x 1
find fog and gof and hence, find fog (2) and gof 3 .
x 1, if x is odd
f x is bijective (both one-one
x 1, if x is even
and onto).
26. Determine which of the following binary operation is
associative and which is commutative:
(i) * on N defined by a * b = 1 for all a, b ∈ N
(ii) * on Q defined by a * b
a b for all a, b ∈ Q
2
x
27. Show that f : 1,1 R, given by f x is
x 2
one-one. Find the inverse of the function f : 1,1 R
Range f .
28. Show that function f : R x, R : 1 x 1
x
defined by f x , x R is one-one and onto
1 | x |
function.
29. Consider the binary operations * : R R R and
o : R R R defined as a *b a b and a ob a,
such that a, b R . Show that * is commutative but not
associative, o is associative but not commutative.
Further, show that
a , b, c R , a * boc a * b o a * c .
30. If A = {1, 2, 3, 4}, B = {3, 5, 7, 9}, C = {7, 23, 47, 79}
and f :A → B, f(x) = 2x + 1, g : B → C, g(x) = x2 - 2,
then write (gof)-1 and f-1og-1 in the form of ordered pair.
EXERCISE – 2: Basic Objective Questions
Section–A (Single Choice Questions)
6. For real number x and y , are write x R y
1. Which of the following functions from I (Set of
Integers) to itself is a bijection x y 2 is an irrational number. Then, the
3 relation R is
(a) f x x (b) f x x 2
(a) Reflexive (b) Symmetric
2
(c) f x 2 x 1 (d) f x x x
(c) Transitive (d) None of these
2. Let A Q Q, where Q is the set of all natural 7. Let ‘*’ be a binary operation on Q defined by:
involves and ‘*’ be the binary operation on A 3ab
a *b . Its identity element is
defined by: a , b * c , d ac , b ad for 5
a , b , c , d A. Then 3 5
(a) (b)
(a) Identity element of ‘*’ in A is (0, 1) 5 3
(c) 1 (d) does not exist
1 b
(b) Inverse element of ‘*’ in A is ,
a a
8. Let S be the set of all real numbers. Then, the
(c) Identity element of ‘*’ in A is (0, -1)
relation R a , b : 1 ab 0 on S is.
1 b
(d) Inverse element of ‘*’ in A is , (a) Reflexive and symmetric but not transitive
a a
(b) Reflexive and transitive but not symmetric
(c) Symmetric, transitive but not reflexive
3. The relation R is defined on the set of natural
(d) Reflexive, transitive and symmetric
numbers as a, b : a 2b . Then, R 1 is given by
(a) 2,1 , 4, 2 , 6, 3 , ... 9. If f : R R is defined by:
1
(b) 1, 2 , 2, 4 , 3, 6 , ...
f x 3 x
3 3
, then fof x is equal to
1
(c) R is not defined (a) 3x (b) x
(d) None of these 1
(c) (d) None of these
x
4. The relation R on set A = {1, 2, 4} given by
R 1,1 , 2, 2 , 3, 3 , 1, 2 , 2, 3 , 1, 3 is 10. Let A 1, 2, 3 and B 2, 4, 6, 8 . Consider the
(a) Reflexive but not symmetric rule f : A B , f x 2 x x A. The domain,
(b) Reflexive but not transitive codomain and range of f respectively are
(c) Symmetric and transitive (a) 1, 2, 3 , 2, 4, 6 , 2, 4, 6, 8
(d) Neither symmetric nor transitive
(b) 1, 2, 3 , 2, 4, 6, 8 , 2, 4, 6
(b) Assertion is correct, reason is correct; reason is (a) Both Assertion and Reason are correct and
Reason is the correct explanation for Assertion.
not a correct explanation for assertion.
(b) Both Assertion and Reason are correct but
(c) Assertion is correct but reason is incorrect. Reason is not the correct explanation for
(d) Assertion is incorrect but reason is correct. Assertion.
(c) Assertion is correct but Reason is incorrect.
23. Assertion: The relation R on the set N N , defined
(d) Assertion is incorrect but Reason is correct.
by a, b R c, d a d b c for all
a, b , c, d N N is an equivalence relation.
Reason: Any relation R is an equivalence relation, if
it is reflexive, symmetric and transitive.
EXERCISE – 3: Previous Year Questions
10. Show that the relation R defined by (a, b) R (c, d)
1. If R x, y : x 2 y 8 is a relation on N, write a d b c on the set N × N is an equivalence
the range of R. (AI 2014)
relation. (AI 2010, 2008)
2.
Let R { a, a
3
:a is a prime number less than 5} 11. Let f : X Y be a function, define a relation R on
be a relation. Find the range of R. (Foreign 2014) X given by R a, b : f a f b . Show that R
3. Let R be the equivalence relation in the set is an equivalence relation on X.
A 0, 1, 2, 3, 4,5 given by R { a , b : 2 (AI 2010 C)
divides a b }. Write the equivalence class [0]. 12. Prove that the relation R in the set A 1, 2, 3, 4, 5
(Delhi 2014 C) given by R a, b : a b is even}, is an
4. State the reason for the relation R in the set {1, 2, 3} equivalence relation. (Delhi 2009)
given by R = {(1, 2), (2, 1)} not to be transitive. 13. Check whether the relation R defined in the set
(Delhi 2011) 1, 2, 3, 4, 5, 6 as R { a, b : b a 1} is
5. Let A 1, 2, 3, ..., 9 and R be the relation in reflexive, symmetric or transitive. (AI 2007)
A A defined by (a, b) R (c, d) if a d b c 14. Let N denote the set of all natural numbers and
for (a, b), (c, d) in A A . Prove that R is an R be the relation on N N defined by
equivalence relation. Also obtain the equivalence b, c R a, d , if ad b c bc a d , then show
class 2, 5 . (Delhi 2014) that R is an equivalence relation. (Delhi 2015)
6. Let R be a relation defined on the set of natural 15. Show that the relation R in the set
numbers N as follows: A 1, 2, 3, 4, 5, 6 given by R{ a, b : a b is
divisible by 2} is an equivalence relation. Write all
R { x, y | x N , y N and 2x + y = 23}
the equivalence classes of R. (AI 2015 C)
Find the domain and range of the relation R. Also,
16. Let A = 1, 2, 3 , B = 4, 5, 6, 7 and let
find if R is an equivalence relation or not.
(Delhi 2014 C) f 1, 4 , 2, 5 , 3, 6 be a function from A to
7. Show that the relation S in the set R of real numbers B, state whether f is one-one or not. (AI 2011)
3
defined as S { a, b : a, b R and a b } is 17. What is the range of the function
neither reflexive, nor symmetric, nor transitive.
x 1
(Delhi 2010) f x ? (Delhi 2010)
x 1
8. Let Z be the set of all integers and R be the relation
on Z defined as R {(a, b) : a, b Z and (a - b) is 18. State whether the function f : N N given by
divisible by 5}. Prove that R is an equivalence
relation. (Delhi 2010) f x 5 x is injective, surjective or both.
9. Show that the relation S in the set (AI 2008 C)
A=x Z: 0 x 12 is given by
19. Show that f : N N , given by
S { a, b : a, b Z, a b is divisible by 4} is an
equivalence relation. Find the set of all elements
related to 1. (AI 2010)
f x x 1, if x is odd
x 1, if x is even
is both one-one and onto.
(AI 2008)
20. Let f : N N be defined by 30. If f : R R is defined by f x x 2 3 x 2,
n 1
, if n is odd
find f f x . (AI 2007)
f n 2 31. If the function f :RR be given by
n , if n is even 2
2 f x x 2 and g:RR be given by
1 4x 3
f x is one-one and onto. Hence find
25. If f : R R is defined by f x 3 x
3 3
, then 6x 4
1
find fof x . (AI 2010) f . (Delhi 2013)
(Delhi 2014 C)
57. Consider the binary operations * : R R R and 64. Let A R R and * be the binary operation on A
o: RR R defined as a *b a b and defined by a , b * c, d a c, b d . Show
a o b a for all, a , b R. Show that '* ' is that * is commutative and associative. Find the
identity element for * on A. (Delhi 2015 C)
commutative but not associative, 'o' is associative
but not commutative. (AI 2012) 65. Prove that the function f : N N , defined by
2
58. Consider the binary operation * on the set defined f x x x 1 is one-one but not onto. Find
by a*b = min a,b . Write the operation table of inverse of f : N S , where S is range of f .
the operation *. (AI 2011)
(Delhi 2019)
59. A binary operation * on the set 0, 1, 2, 3, 4, 5 is
66. Show that the function f : R R defined by
defined as : a *b a b, if a b 6
a b 6, if a b 6
f x 2
x 1
x
, x R is neither one-one nor onto.
Show that zero is the identity for this operation and Also if g : R R is defined as g x 2 x 1, find
each element a 0 of the set is invertible with
fog x . (2018)
6 a being the inverse of a . (AI 2011)
67. Let A x Z : 0 x 12 . Show that
60. Let * be a binary operation on Q defined by
R a, b : a, b A and a b is divisible by 4}.
3ab
a *b . Show that * is commutative as well as is an equivalence relation. Find the set of all
5
elements related to 1. Also write the equivalence
associative. Also, find its identity element if it class [2]. (2018)
exists. (Delhi 2010)
68. A relation in a set A is called _______ relation, if
61. Let * be a binary operation on the set of rational each element of A is related to itself. (2020)
2
numbers given as a * b 2 a b , a , b Q. Find 4x 3 2
69. If f x ,x , then show that
3* 5 and 5 * 3. Is 3 * 5 5 * 3 ? (Delhi 2008 C) 6x 4 3
62. Let * be the binary operation on N given by 2
a * b L.C .M . of a and b . Find the value of
fof x x, for all x . Also, write inverse of
3
20 *16. Is * (i) commutative, (ii) associative f. (2020)
(AI 2008 C) 70. Check if the relation R in the set R of real numbers
63. Show that the binary operation * on A R 1 defined as R a, b : a b is (i) symmetric, (ii)
defined as a * b a b ab for all a, b A is transitive (2020)
commutative and associative on A. Also find the
identify element of * in A and prove that every
element of A is invertible. (AI 2016, 2015)
Answer Key
EXERCISE-1:
Basic Subjective Questions
n A n B
2. (–2) 3. 2 11
24. fog 2 6; gof 3
10
4. Co-domain 5. Commutative
26. (i) commutative and associative.
6. , 1 2, 7. [–5, 5]
(ii) commutative but not associative.
1
8. f {(a,1), (b, 2), (c,3)} 9. {2, 4, 6} 1
30. gof 7, 1 , 23, 2 , 47, 3 , 79, 4
5x 4
10. {–1, 1} 11.
3 f 1og 1 7, 1 , 23, 2 , 47, 3 , 79, 4
1
16. , 1
3
11. (c) 12. (b) 13. (b) 14. (c) 15. (b)
16. (d) 17. (d) 18. (a) 19. (c) 20. (a)
21. (a) 22. (b) 23. (a) 24. (d) 25. (c)
Range = {2, 4, 6, 8, 10, 12, ……….., 22} 40. (i) x (ii) –3 ; Yes, f–1 = g
9. Set of elements related to 1 is {5, 9} 41. (a) 4x2 –6x + 1 (b) 2x2 + 6x –1 42. (2)