0% found this document useful (0 votes)
23 views3 pages

1 Relation and Functions 2021-22

This document discusses relations and functions. It contains definitions of reflexive, symmetric, transitive and equivalence relations. It also defines one-one, onto and bijective functions. There are 65 questions ranging from one mark to five marks about relations and functions, their properties and examples.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
23 views3 pages

1 Relation and Functions 2021-22

This document discusses relations and functions. It contains definitions of reflexive, symmetric, transitive and equivalence relations. It also defines one-one, onto and bijective functions. There are 65 questions ranging from one mark to five marks about relations and functions, their properties and examples.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

1: RELATIONS AND FUNCTIONS

ONE MARK QUESTIONS 20. Let * be the binary operation defined on the
set of rational numbers Q defined by 𝑎 ∗ 𝑏 =
1. Define Reflexive Relation 𝑎𝑏 + 1, prove that * is commutative.
2. Define Symmetric Relation 21. Let * be the binary operation defined on the
3. Define Transitive Relation set of rational numbers Q defined by𝑎 ∗ 𝑏 =
4. Define Equivalence Relation 𝑎𝑏
find the identity element.
4
5. A relation R on A={1,2,3} defined by R={(1,1)
22. Let * be the binary operation on N given by
(1,2),(3,3)} is not symmetric why?
𝑎 ∗ 𝑏 = 𝑙𝑐𝑚 𝑜𝑓 𝑎 & 𝑏, find 5*7
6. Give the example of a relation which is
23. Let * be the binary operation on N given by
Symmetric, transitive but not reflexive.
𝑎 ∗ 𝑏 = 𝑙𝑐𝑚 𝑜𝑓 𝑎 & 𝑏, find 20*16
7. Give the example of a relation which is
24. An operation * on 𝑍 + (the experiment of all
reflexive and Symmetric, but not transitive.
non negative integer) is defined as
8. Give an example of a relation defined on set
𝑎 ∗ 𝑏 = 𝑎 − 𝑏 ∀𝑎, 𝑏 ∈ 𝑍 + is * is binary
A={1,2,3}, which is symmetric but neither
operation on 𝑍 +
reflexive nor transitive.
25. An operation * on 𝑍 + (the experiment of all
9. Give the example of a relation which is
non negative integer) is defined as
Reflexive only.
𝑎 ∗ 𝑏 = |𝑎 − 𝑏| ∀𝑎, 𝑏 ∈ 𝑍 + is * is binary
10. Give the example of a relation which is
operation on 𝑍 +
Symmetric only.
26. An operation * is defined by 𝑎 ∗ 𝑏 = 𝑎 .Is * is
11. Write the smallest reflexive relation on the
a binary operation on 𝑍 +
set 𝐴 = {𝑎, 𝑏}
12. Write down the identity relation on the set
TWO MARKS QUESTIONS
𝐴 = {x, y, z}
13. Define One-One function
27. A relation R is defined on the set
14. Define Onto function
𝐴 = {1,2,3,4,5,6} by 𝑅 =
15. Define Bijective function
{(𝑥, 𝑦): 𝑦 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑏𝑙𝑒 𝑏𝑦 𝑥}. Verify whether R
16. State with reason whether the function
is symmetric and reflexive or not. Give
ℎ: {2,3,4,5} → {7,9,11,13} has inverse with
reason.
ℎ = {(2,7), (3,9), (4,11), (5,13)}
28. Verify whether the operation ∗ defined on Q
17. A relation R on A={1,2,3} defined by R={(1,1) 𝑎𝑏
(1,2),(3,3)} is not symmetric why? by 𝑎 ∗ 𝑏 = is associative or not?
2

18. Let 𝑓: 𝑅 → 𝑅 is defined by 29. Show that the function 𝑓: 𝑁 → 𝑁 given by


𝑓(𝑥 ) = 2𝑥 − 3 ∀𝑥 ∈ 𝑅. Write𝑓 −1 . 𝑓(1) = 𝑓(2) = 1 and 𝑓 (𝑥 ) = 𝑥 − 1 for every
19. Find the number of all one-one functions 𝑥 > 2 is onto but not one-one.
from set A ={1,2,3} to itself. 30. If 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥 ) = 1 + 𝑥 2 then
show that f is neither one-one nor onto.
31. Show that the greatest integer function 44. Check whether the relation R defined in the
𝑓(𝑥 ) = 𝑅 → 𝑅 defined by 𝑓(𝑥 ) = [𝑥] is set {1,2,3,4,5,6} as 𝑅 = {(𝑎, 𝑏): 𝑏 = 𝑎 + 1} is
neither one-one nor onto. reflexive or symmetric.
32. State whether the function 𝑓: 𝑅 → 𝑅 defined 45. Show that the relation R in the set of real
by 𝑓(𝑥 ) = 1 + 𝑥 2 ∀𝑥 ∈ 𝑅 is one-one, onto or numbers R defined as 𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏} is
objectives justify your answer. reflexive and transitive but not symmetric .
33. Show that 𝑓: 𝐴 → 𝐵 and 𝑔: 𝐵 → 𝐶 are one-one 46. Show that the relation R in the set of real
then 𝑔𝑜𝑓: 𝐴 → 𝐶 is also one-one. numbers R defined as 𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏2 } is
34. Show that 𝑓: 𝐴 → 𝐵 and 𝑔: 𝐵 → 𝐶 are onto neither reflexive nor symmetric nor
then 𝑔𝑜𝑓: 𝐴 → 𝐶 is also onto. transitive.
35. If function 𝑓: 𝑅 → 𝑅 and 𝑔: 𝑅 → 𝑅 are given 47. Show that relation R in the set of all integer
by 𝑓(𝑥 ) = 𝑐𝑜𝑠𝑥 and 𝑔(𝑥 ) = 3𝑥 2 then show Z defined by 𝑅 = {(𝑎, 𝑏): 2 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑎 − 𝑏} is
that 𝑔𝑜𝑓 ≠ 𝑓𝑜𝑔 an equivalence relation.
36. If function 𝑓: 𝑅 → 𝑅 and 𝑔: 𝑅 → 𝑅 are given 48. Show that relation R in the set of all integer
by 𝑓(𝑥 ) = |𝑥 | and 𝑔(𝑥) = [𝑥 ] (where [𝑥] is a Z defined by 𝑅 = {(𝑎, 𝑏): 5 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑎 − 𝑏} is
greatest integer function) find an equivalence relation.
1
𝑓𝑜𝑔 (− 2) 𝑎𝑛𝑑 𝑔𝑜𝑓 (− 2)
1 49. Prove that relation R in the set of integers Z
defined by 𝑅 = {(𝑥, 𝑦): 𝑥 − 𝑦 𝑖𝑠 𝑎𝑛 𝑖𝑛𝑡𝑒𝑔𝑒𝑟} is
37. If 𝑓 (𝑥 ) = |𝑥 | and 𝑔(𝑥) = |5𝑥 − 2| then find
(𝑖 )𝑔𝑜𝑓 (𝑖𝑖 )𝑓𝑜𝑔 an equivalence relation.
38. Find the gof and fog if 𝑓 (𝑥 ) = 8𝑥 3 and 50. Show that relation R in the set
1 𝐴 = {𝑥: 𝑥 ∈ 𝑍, 0 ≤ 𝑥 ≤ 12} given by
𝑔 (𝑥 ) = 𝑥 3
1
𝑅 = {(𝑎, 𝑏): |𝑎 − 𝑏| 𝑖𝑠 𝑎 𝑚𝑢𝑙𝑖𝑡𝑖𝑝𝑙𝑒 𝑜𝑓 4} is an
39. If 𝑓: 𝑅 → 𝑅 be given by 𝑓(𝑥 ) = (3 − 𝑥 3 )3 find equivalence relation.
𝑓𝑜𝑓(𝑥). 51. Show that the relation R in the set
40. If 𝑓: 𝑅 → 𝑅 be given by 𝑓(𝑥 ) = 𝑥 2 − 3𝑥 + 2, 𝐴 = {1,2,3,4,5} given by
find 𝑓(𝑓(𝑥)). 𝑅 = {(𝑎, 𝑏): |𝑎 − 𝑏| 𝑖𝑠 𝑒𝑣𝑒𝑛}. is an
41. Define the binary operation on a set. Verify Equivalence Relation.
whether the operation * defined on Z by 52. Let 𝐴 = 𝑅 − {3} and 𝐵 = 𝑅 − {1} consider the
𝑎 ∗ 𝑏 = 𝑎𝑏 + 1 Is binary or not. 𝑥−2
𝑓: 𝐴 → 𝐵 defined by 𝑓(𝑥 ) = 𝑥−3 is 𝑓 is one-
42. Define the binary operation on a set. Verify
one and onto. Justify your answer.
whether the operation * defined on Q set of
53. Find 𝑔𝑜𝑓 and 𝑓𝑜𝑔 if 𝑓: 𝑅 → 𝑅 and 𝑔: 𝑅 → 𝑅
rational numbers by 𝑎 ∗ 𝑏 = 𝑎𝑏 + 1, ∀ 𝑎, 𝑏 ∈
are given by 𝑓 (𝑥 ) = 𝑐𝑜𝑠𝑥 and 𝑔(𝑥 ) = 3𝑥 2
𝑄 is binary or not.
show that 𝑔𝑜𝑓 ≠ 𝑓𝑜𝑔
54. If f & g are two functions defined by 𝑓 (𝑥) =
THREE MARKS QUESTIONS
2𝑥 + 5 and 𝑔(𝑥 ) = 𝑥 2 + 5 find
(i) 𝑔𝑜𝑓(2) (ii) 𝑓𝑜𝑔(2) (iii) 𝑓𝑜𝑓(2)
43. Determine whether is the relation R in the
55. If ∗ is a binary operation defined on 𝐴 = 𝑁 ×
set 𝐴 = {1,2,3,4, … … 13,14} defined as
𝑁 by (𝑎, 𝑏) ∗ (𝑐, 𝑑 ) = (𝑎 + 𝑐, 𝑏 + 𝑑). Prove
𝑅 = {(𝑥, 𝑦): 3𝑥 − 𝑦 = 0} is reflexive,
that ∗ is both commutative and Associative.
symmetric and transitive.
Find the identity if exists.
FIVE MARKS QUESTIONS 62. Check the injectivity and surjectivity of the
function f : R  R , given by f  x   3  4x . Is it
56. Prove the function 𝑓: 𝑁 → 𝑌 defined by a Bijective function?
𝑓(𝑥 ) = 𝑥 2 where 𝑌 = {𝑦: 𝑦 = 𝑥 2 , 𝑥𝜀𝑁} is 63. If 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥 ) = 1 + 𝑥 2 then
invertible. Also write the inverse of 𝑓 show that f is neither one-one nor onto.
57. Consider 𝑓: 𝑅 → [5, ∞) defined by 𝑓 (𝑥 ) = 64. Show that the function f : R *  R * , defined by
9𝑥 2 + 6𝑥 − 5. Show that ′𝑓′ is invertible with 1
f  x   is both one−one and onto, where R *
√𝑦+6−1 x
𝑓 −1 (𝑦) = is the set of all non−zero real numbers.
3
58. Consider 𝑓: 𝑁 → 𝑅 be defined by 𝑓 (𝑥 ) = 65. Show that the modulus function f : R  R ,
4𝑥 2 + 12𝑥 + 15. Show that ′𝑓′ is invertible given by f  x   x is neither one−one nor onto,
and also find the inverse where |x| is x, if x is positive or 0 and |x| is
59. Prove that the function 𝑓: 𝑁 → 𝑌 defined by − x, if x is negative.
66. Verify whether the function f : N  N defined
𝑓(𝑥 ) = 4𝑥 + 3 Where 𝑌 = {𝑦: 𝑦 = 4𝑥 +
by f  x   x 2 is one−one, onto and bijective.
3 , 𝑥𝜀𝑁} is invertible. Also Write the inverse
67. Check injectivity and surjectivity of the
of 𝑓(𝑥).
function f : R  R given by f  x   x 2 .
60. Consider 𝑓: 𝑁 → 𝑅 be defined by 𝑓 (𝑥 ) =
68. Check injectivity and surjectivity of the
4𝑥 2 + 12𝑥 + 5. Show that ′𝑓′ is invertible
function f : Z  Z given by f  x   x 2 .
and also find the inverse
69. Verify whether the function 𝑓: 𝑅 → 𝑅 defined
61. Consider 𝑓: 𝑅+ → [4, ∞) defined by 𝑓(𝑥 ) =
by 𝑓(𝑥) = 3𝑥 is one−one, onto and bijective.
𝑥 2 + 4. Show that ′𝑓′ is invertible & also find 70. Verify whether the function 𝑓: 𝑅 → 𝑅 defined
inverse by 𝑓(𝑥) = 2𝑥 is one−one, onto and bijective.

You might also like