CHAPTER-1(RELATIONS AND FUNCTIONS)
S.N Relation : A relation R from a non-empty set A to a non-empty set B is a subset of A × B.
**A relation R in a set A is called
(i) Reflexive, if (a, a) ∈ R, for every a∈ A,
(ii) Symmetric, if (a, b) ∈ R then (b, a)∈ R,
(iii)Transitive, if (a, b) ∈ R and (b, c)∈ R then (a, c)∈ R.
** Equivalence Relation :R is equivalence if it is reflexive, symmetric and transitive.
** Function :A relation f : A →B is said to be a function if every element of A is correlated to
unique
element in B.
* A is domain
* B is codomain
* For any x element x∈ A, function f correlates it to an element in B, which is denoted by f(x)
and
is called image of x under f . Again if y= f(x), then x is called as pre- image of y.
* Range = {f(x) | x ∈A }. Range ⊆ Codomain
* The largest possible domain of a function is called domain of definition.
**Composite function :Let two functions be defined as f : A → B and g : B → C. Then we can
define a
function gof: A →C is called thecomposite function off and g.
** Different type of functions : Let f : A →B be a function.
*f is one to one (injective) mapping, if any two different elements in A is always correlated to
different
elements in B, i.e. x1 ≠ x2⇒f(x1) ≠ f(x2) or f(x1) = f(x2) ⇒x1 = x2
*f is many one mapping, if ∃ at least two elements in Asuch that their images are same.
*f is onto mapping (subjective), if each element in B is having at least one preimage.
*f isinto mapping if range ⊆ codomain.
*f is bijective mapping if it is both one to one and onto.
RESULTS :1. A relation 𝑅 in a set 𝐴, if n(A)= n then,
𝟐
a) Number of relation from A to A = 𝟐𝒏
𝟐
b) Number of reflexive relation from A to A = 𝟐𝒏 −𝒏
𝒏(𝒏+𝟏)
c) Number of symmetric relation from A to A = 𝟐 𝟐
𝟐
d) Number of relation from A to A which are not symmetric = 𝟐(𝒏 −𝒏)/𝟐
2- Let a function f : X → Y where n (X) = n & n (Y) = m.
a)Total number of functions = mn= (no of elements in co-domain)no. of elements in domain
𝒎𝒄𝒏 𝒏! , 𝒊𝒇 𝒎 ≥ 𝒏
b) Total number of one-one functions={
𝟎, 𝒊𝒇 𝒎 < 𝒏
𝒎𝒏 − 𝒎𝒄𝒏 𝒏! , 𝒊𝒇 𝒎 ≥ 𝒏
c) Total number of many one functions={
𝒎𝒏 , 𝒊𝒇 𝒎 < 𝒏
d) Total number of onto function =
𝒎𝒏 − 𝒎𝒄𝟏 (𝒎 − 𝟏)𝒏 − 𝒎𝒄𝟐 (𝒎 − 𝟐)𝒏 + 𝒎𝒄𝟑 (𝒎 − 𝟑)𝒏 − ⋯ , 𝒊𝒇 𝒎 ≤ 𝒏
{ 𝒎! , 𝒊𝒇 𝒎 = 𝒏
𝟎 , 𝒊𝒇 𝒎 > 𝒏
𝒎𝒏 − 𝒎𝒄𝟏 (𝒎 − 𝟏)𝒏 − 𝒎𝒄𝟐 (𝒎 − 𝟐)𝒏 + 𝒎𝒄𝟑 (𝒎 − 𝟑)𝒏 − ⋯ , 𝒊𝒇 𝒎 ≤ 𝒏
{ 𝒎 𝒏
, 𝒊𝒇 𝒎 > 𝒏
e)Total number of into functions=
1
𝒎𝒄𝟏 (𝒎 − 𝟏)𝒏 − 𝒎𝒄𝟐 (𝒎 − 𝟐)𝒏 + 𝒎𝒄𝟑 (𝒎 − 𝟑)𝒏 − ⋯ , 𝒊𝒇 𝒎 ≤ 𝒏
{ 𝒎𝒏 , 𝒊𝒇 𝒎 > 𝒏
f)Total number of one-one and onto functions= m!
g) Total number of constant functions = m
h) Total number of onto functions from the set { 1, 2, 3, ….,n} = n!
TYPES OF RELATIONS:
* EMPTY RELATION:A relation 𝑅 in a set 𝐴 is called empty relation, if no element of 𝐴 is
related to any element of 𝐴, i.e., 𝑅 = ∅ ⊂ 𝐴 × 𝐴.
* UNIVERSAL RELATION:A relation 𝑅 in a set 𝐴 is called universal relation, if each element
of 𝐴
is related to every element of 𝐴, i.e. , 𝑅 = 𝐴 × 𝐴.
* TRIVIAL RELATIONS:Both the empty relation and the universal relation are sometimes
called
trivial relations.
* A relation R in a set A is called
a) Reflexive, if (𝑥, 𝑥) ∈ 𝑅 𝑓𝑜𝑟 𝑒𝑣𝑒𝑟𝑦 𝑥 ∈ 𝐴
b) Symmetric, 𝑖𝑓 (𝑥, 𝑦) ∈ 𝑅 𝑖𝑚𝑝𝑙𝑖𝑒𝑠 𝑡ℎ𝑎𝑡 (𝑦, 𝑥) ∈ 𝑅 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑥, 𝑦 ∈ 𝐴
c) Transitive, 𝑖𝑓 (𝑥, 𝑦) ∈ 𝑅 𝑎𝑛𝑑 (𝑦, 𝑧) ∈ 𝑅𝑖𝑚𝑝𝑙𝑖𝑒𝑠 𝑡ℎ𝑎𝑡 (𝑥, 𝑧) ∈ 𝑅𝑓𝑜𝑟 𝑎𝑙𝑙 𝑥, 𝑦, 𝑧 ∈ 𝐴
* EQUIVALENCE RELATION:𝐴 relation 𝑅 in a set 𝐴 is said to be an equivalence relation if
𝑅 is
reflexive, symmetric and transitive.
* EQUIVALENCE CLASS: Let 𝑅 be an equivalence relation on a non-empty set 𝐴 and 𝑎 ∈ 𝐴.
Then the set of all those elements of 𝐴 which are related to 𝑎, is called the
equivalence class determined by 𝑎 and is denoted by [𝑎].i.e[𝑎] = {𝑥 ∈ 𝐴 ∶ (𝑥, 𝑎) ∈ 𝑅}
* TYPES OF FUNCTIONS:
* ONE-ONE (INJECTIVE) FUNCTION: A function 𝑓 ∶ 𝑋 → 𝑌 is defined to be one-one (or
injective), if the images of distinct elements of X under f are distinct, i.e., for
every𝑥1 , 𝑥2 ∈ 𝑋, 𝑓(𝑥1) = 𝑓( 𝑥2 ) 𝑖𝑚𝑝𝑙𝑖𝑒𝑠 𝑥1 = 𝑥2 . Otherwise, f is called many-one.
*ONTO (SURJECTIVE) FUNCTION :A function 𝑓 ∶ 𝑋 → 𝑌 is said to be onto (or surjective), if
every
element of 𝑌 is the image of some element of 𝑋 under f. i.e., for every 𝑦 ∈ 𝑌, there exists an
element 𝑥 𝑖𝑛 𝑋 such that 𝑓(𝑥) = 𝑦.
NOTE:f : X → Y is onto if and only if Range of f = Codomain.
* BIJECTIVE FUNCTION:A function 𝑓 ∶ 𝑋 → 𝑌 is said to be bijective, if 𝑓 is both one-one
and onto.
1 State the reason for the relation R in the set{1, 2, 3} given by R = {(1, 2), (2, 1)} is not to be
transitive
2 If R = {(x, y) : x + 2y = 8} is a relation on N, write the range of R. 2014 1
3 1. Let R be a relation defined on the set of natural numbers N as follows:
R = {(x, y), x N, y N and 2x + y = 24}. Find the domain and range of the relation R.
Also, find if R is an equivalence relation or not.
4 Let R be the equivalence relation in the setA = {0, 1, 2, 3, 4, 5} given by R = {(a, b) : 2 2019 4
divides (a – b)}.Write the equivalence class [0].
2
5 Show that the relation R defined byR={(a, b): a, bN, and (a–b) is divisible by 3} is an 4
equivalence relation.
6 Show that the relation R in the set R of real numbers, defined as R = {(a, b): a b2} is
neither reflexive nor symmetric nor transitive.
7 Show that the relation S in the set R defined as S = {(a, b): a, bR and a ≤ b3} is neither 2024 5
reflexive, nor symmetric, nor transitive.
8 Show that the relation R in the set R of real numbers, defined as R = {(a, b): a b} is reflexive 2019 4
and transitive but not symmetric
9 Check wether the relation R defined on the set A={1,2,3,4,5,6} as R={(a, b): b=a+1} is 2019 4
reflexive ,symmetric or transitive
10 Let T be the set of all triangles in a plane with R as a relation in T given by R={(T1,T2):T1 2008 4
T2}. Show that R is an equivalence relation.
11 Show that the relation S in the set A {x Z : 0 x 12} given by S = {(a, b): a, bZ, |a 2010 4
– b| is divisible by 4} is an equivalence relation. Find the set of all elements related to 1. 2018
2019
12 Prove that the relation R in the set A= {1,2,3,4,5,6,7}given by given by R = {(a, b): |a – b| is 2019 4
even} is an equivalence relation.
13 Let R be the relation defined in the set A = {1, 2, 3, 4, 5, 6, 7} by R = {(a, b) : both a and b 2024 5
are either odd or even}. Show that R is an equivalence relation. Hence, find the elements
of equivalence class [1].
14 Show that relation R in on the set of all integers Z, given by R = {(a, b): 2 divides (a-b)}, is 2019 4
an equivalence relation.
15 Show that relation R in on the set of all integers Z, given by R = {(x, y): 5 divides (x-y)}, is 2020 4
an equivalence relation.
16 Show that relation R in A = {1, 2, 3, 4, 5} given by R = {(a, b): |a – b| is divisible by 2},
is an equivalence relation. Show that all the elements of {1, 3, 5} are related to each
other and all the elements of {2, 4} are related to each other, but no element of {1, 3, 5}
is related to any element of {2, 4}. Write all the equivalence classes of R.
17 Show that the relation S defined on the set NxN by (a, b)S(c, d) a + d = b + c is an 2010 4
equivalence relation. 2024
18 Let A = {1, 2,3, …9} and R be the relation in AxA defined by (a, b) R (c, d) if a +d = b +
c for a, b, c, d A.Prove that R is an equivalence relation. Also obtain equivalence class
[(2, 5)].
19 Let N denote the set of all natural numbers and R be the relation on N x N defined by (a, 2023 5
b) R (c, d) if ad (b + c) = bc (a + d). Show that R is an equivalence relation
20 Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1,4), (2, 5), (3, 6)}be a function from A to B. 2011 1
State whether f is one – one or not.
21 State whether the function f: N N given by f(x) = 5x is injective, surjective or both.
22 If the function f: RR defined by f(x) = 3x – 4 is injective, surjective or both.?
23 𝟐𝒙−𝟕
If f:RR defined as f(x) = is injective, surjective or both.?
𝟒
24 𝒙−𝟏
Let A = R – {2} and B = R – {1}. If f: A B defined by𝒇(𝒙) = . Show that ‘f’ is one
𝒙−𝟐
– one and onto and hence find f –1.
3
25 𝟐 𝟒𝒙+𝟑 2019 4
Show that the function f in A = R – {𝟑} defined as𝒇(𝒙) = 𝟔𝒙−𝟒 is one – one and onto.Find
the inverse of f and hence find f –1 (0) and x such that f –1(x) = 2.
26 𝟒 𝟒𝒙 2023 5
Show that the function f in A = R – {− 𝟑} defined as𝒇(𝒙) = 𝟑𝒙+𝟒 is one – one. Also check
whether f is onto or not. Hence find f-1 in (Range of ) A
27 𝒏 + 𝟏, 𝒊𝒇 𝒏 𝒊𝒔 𝒆𝒗𝒆𝒏 2012 4
Show that f:WW, given by 𝒇(𝒏) = { is bijective function.
𝒏 − 𝟏, 𝒊𝒇 𝒏 𝒊𝒔 𝒐𝒅𝒅
28 𝒏+𝟏 2009 4
, 𝒘𝒉𝒆𝒏 𝒏 𝒊𝒔 𝒐𝒅𝒅
Let f:NN be defined by 𝒇(𝒏) = { 𝒏𝟐 for all nN. State whether the
, 𝒘𝒉𝒆𝒏 𝒏 𝒊𝒔 𝒆𝒗𝒆𝒏
𝟐
function f is bijective. Justify your answer.
𝒙
29 Show that the function f: RR defined by 𝒇(𝒙) = 𝒙𝟐 +𝟏 , ∀ , 𝒙 ∈ 𝑹 is neither one-one nor 2020 4
onto.
30 Let f: N R defined by f(x) = x2 + x + 1 is one-one but not onto. Find the inverse of f: N 2019 4
S where S is the range of f.
31 Let the relation R be given as R = {(x, y) : x, y ∈ N and x + 3y = 12}. Find the domain 2024 2
and range of R.
OR
(b) Show that the function f : RR , f(x) = x4 is neither one-one nor onto.
32 A function f : A B defined as f(x) = 2x is both one-one and onto. If A = {1, 2, 3, 4}, then 2024 2
find the set B.
33 A relation R is defined on a set of real numbers R as R = {(x, y) : x . y is an irrational 2023 5
number}. Check whether R is reflexive, symmetric and transitive or not
34 A function f : [4,4][0,4] is given by 𝒇(𝒙) = √𝟏𝟔 − 𝒙𝟐 . Show that f is an onto function 2023 5
but not a one-one function.Further, find all possible values of ‘a’ for which f(a)=√𝟕
𝒙
35 Show that the function f: R(𝒙 ∈ 𝑹: −𝟏 < 𝒙 < 𝟏} defined by f(x)=𝟏+|𝒙| , 𝒙 ∈ 𝑹 is one-
one and onto function.
4
CHAPTER-2 (INVERSE TRIGONOMETRIC FUNCTIONS)
PRINCIPAL VALUE BRANCH
FUNCTION DOMAIN RANGE (PRINCIPAL VALUE
BRANCH)
𝝅 𝝅
𝐬𝐢𝐧−𝟏 𝒙 [-1 ,1] [− 𝟐 , 𝟐 ]
𝐜𝐨𝐬−𝟏 𝒙 [-1 ,1] [0, 𝝅]
𝝅 𝝅
𝐭𝐚𝐧−𝟏 𝒙 R (-𝟐 , 𝟐 )
𝝅 𝝅
𝐜𝐨𝐬𝐞𝐜 −𝟏 𝒙 R-(-1 ,1) [− 𝟐 , 𝟐 ]-{0}
𝝅
𝐬𝐞𝐜 −𝟏 𝒙 R-(-1 ,1) [0, 𝝅]-{𝟐 }
𝐜𝐨𝐭 −𝟏 𝒙 R (0, 𝝅)
7𝜋
1 What is the principal value of cos−1 [𝑐𝑜𝑠 6 ] 2009 1
2 What is the principal value of sec −1 (−2) 2010 1
3 𝐖𝐡𝐚𝐭 𝐢𝐬 𝐭𝐡𝐞 𝐩𝐫𝐢𝐧𝐜𝐢𝐩𝐚𝐥 𝐯𝐚𝐥𝐮𝐞 𝐨𝐟 cot −1(−√3) 2010 1
4𝜋
What is the principal value of sin−1[𝑠𝑖𝑛 ] 2010 1
5
4 1−𝑥 1 2008 1
Solve for ‘x’ tan−1 (1+𝑥) = 2 tan−1(𝑥) , 𝑥 > 0
5 2𝜋 2𝜋 2011 1
What is the value of cos −1 [𝑐𝑜𝑠 ] + sin−1 [sin ]
3 3
6 𝐖𝐫𝐢𝐭𝐞 𝐢𝐬 𝐭𝐡𝐞 𝐩𝐫𝐢𝐧𝐜𝐢𝐩𝐚𝐥 𝐯𝐚𝐥𝐮𝐞 𝐨𝐟 tan−1(√3) − sec −1 (−2) 2012 1
7 𝐖𝐫𝐢𝐭𝐞 𝐢𝐬 𝐭𝐡𝐞 𝐩𝐫𝐢𝐧𝐜𝐢𝐩𝐚𝐥 𝐯𝐚𝐥𝐮𝐞 𝐨𝐟 tan−1 (√3) − cot −1 (−√3) 2013 1
2018
2022
5
8 √3 2013 1
𝐖𝐫𝐢𝐭𝐞 𝐢𝐬 𝐭𝐡𝐞 𝐩𝐫𝐢𝐧𝐜𝐢𝐩𝐚𝐥 𝐯𝐚𝐥𝐮𝐞 𝐨𝐟 tan−1 [2𝑠𝑖𝑛 (2 cos −1 ( ))]
2
−1 (𝑥) −1 (𝑦) 𝜋
9 If tan + tan = 4 , where xy < 1, find the value of (x + y + xy) 2014 1
10 3𝜋 2020 1
The value of sin−1 [cos ]
5
11 1 1 2022 1
The principal value of sin−1 (2) + cos −1 (− 2)
9𝜋
12 The principal value of tan−1[𝑡𝑎𝑛 ] 2022 1
8
13 What is the domain of function cos −1 (2𝑥 − 3) 2022 1
14 √1+𝑥 − √1−𝑥 2022 1
The simplest form of tan−1 [ ]
√1+𝑥 + √1−𝑥
1 1
15 Prove that 𝟑 sin−1 𝑥 = sin −1 (3𝑥 3)
− 4𝑥 x∈ [− 2 , 2] 2018 2
16 9𝜋 9 1 9 2√2 2020 2
Prove that : − 4 sin−1 (3) = 4 sin−1 ( )
8 3
17 Find the domain of y=𝐬𝐢𝐧−𝟏 (𝒙𝟐 − 𝟒) 2023 2
18 −7𝜋 2023 2
𝐸𝑣𝑎𝑙𝑢𝑎𝑡𝑒 cos −1 [𝑐𝑜𝑠 ]
3
19 3𝜋 2024 2
Evaluate: sin−1 [𝑠𝑖𝑛 4 ] + cos−1 [𝑐𝑜𝑠𝜋]+tan−1 1
OR
−𝟏
Draw the graph of 𝐜𝐨𝐬 𝒙, x∈ [−𝟏, 𝟎]