nbxn
hh
BLACK PPT 3.0
Relation & Function
By- SSR Sir
BLACK PPT & QPS Link
🔥For Any Doubts and Queries👇🏻
[Link]
DOUBT
💥Maths Question Practice Sheet👇🏻
[Link]
0EUdvPAGjRAxDKVHzL6?usp=sharing
QPS Black PPT
☄️Maths Black PPT Content👇🏻
[Link]
ve_link
Question
C
𝑥+1
If A = R − {+1} and function 𝑓: A → A is defined by 𝑓(𝑥) = , then 𝑓 −1 (𝑥) is given by:
𝑥−1
A 1
𝑥−1
B 1
1−𝑥
C 𝑥+1
1−𝑥
𝑥+1
D
𝑥−1
Question
Match List I with List II
LIST I LIST II
A A-I, B-III, C-II, D-IV
Signum
A. 𝑓: R → R 𝑓(𝑥) = [𝑥] I.
function
B A-II, B-I, C-III, D-IV
Identity
B. 𝑓: R → R 𝑓(𝑥) = 𝑥 II.
function
C A-II, B-IV, C-I, D-III
Greatest
C. 𝑓: R → R 𝑓(𝑥) = 𝑥 III. Integer
D A-III, B-IV, C-II, D-I
function
−1 if 𝑥<0 Modulus
D. 𝑓: R → R 𝑓(𝑥) = ቐ 0 if 𝑥=0 IV.
function
1 if 𝑥>0
Choose the correct answer from the options given below :
Question
The number of all onto functions from the set {1,2, … … . 𝑛} to itself is
A 2n
B 𝑛2
C n!
D (2𝑛)
Question
The relation R = (a, b): a ≤ b2 on the set of real numbers is:
A Reflexive and symmetric
B Neither reflexive nor symmetric
C Transitive
D Reflexive but not symmetric
Question
Let 𝑓(𝑥) = 𝑥 3 be a function with domain {0,1,2,3} then domain of 𝑓 −1 is :
A {3,2,1,0}
B {0, −1, −2, −3}
C {0,1,8,27}
D {0, −1, −8, −27}
Question
If a set P contains 5 elements and the set Q contains 8 elements, then the number of one-
one functions from A to B is :
A 8C
5
B 8
C5 × 5
C 58
D 85
Question
Relation R on Real Numbers is defined as R = {(a, b): a ≤ b}.
The relation is :
A Reflexive and Symmetric but not Transitive
B Symmetric and Transitive but not Reflexive
C Reflexive and Transitive but not Symmetric
D Equivalence relation
Question
Let * be a binary operation on set 𝑄 of rational numbers given by 𝑎 + 𝑏 = 𝑎 + 𝑏 + 𝑎𝑏. Then
identity element is :
A –1
B 0
C 1
2
D 1
Question
The maximum number of equivalence relations on the set A = {a, b, c} is :
A 1
B 2
C 5
D 3
Question
Let 𝐴 = {1,2,3} and 𝑅 = {(1,1), (1,3), (3,1), (2,2), (2,1), (3,3)} be a relation on 𝐴. Then, 𝑅 is :
A Reflexive
B Both Reflexive and Symmetric
C Symmetric but not Reflexive
D Both Reflexive and Transitive
Question
Let 𝑓: [−2,2] → [−2,2] be a function defined by 𝑓(𝑥) = 𝑥|𝑥|, then 𝑓 is :
A One-one but not onto
B Onto but not one-one
C Neither one-one nor onto
D Bijective
Question
Consider a binary operation on 𝑁 defined as 𝑎 ⋅ 𝑏 = 𝑎3 + 𝑏 3 , choose the correct answer :
A - is both associative and commutative
B - is associative but not commutative
C - is commutative but not associative
D + is neither commutative nor associative
Question
The relation 𝑅 in the set 𝐴 = {1,2,3} given by 𝑅 = {(1,2), (2,1)} is :
A Reflexive
B Symmetric
C Reflexive but not symmetric
D Equivalence Relation
Question
Let 𝑅 be the relation on 𝑊 (uet of Natural numbers) defined by 𝑅 = {(𝑎, 𝑏): 𝑎, 𝑏 ∈ 𝑁
and 𝑏 in divisible by a ). Then the relation 𝑅 is
A Reflexive, symmetric but not Transative.
B Reflexive, Transitive but not symametric.
C Not Reflexive, not transitive, not symmetric.
D Equivalenes relation.
Question
If 𝑓: ℝ → ℝ is a function given by 𝑓(𝑥) = [𝑥] (greatest integer function), then which of the
following is are correct.
A. 𝑓 is one-one
B. 𝑓 is not onto
C. Range of f is I (set of the integers)
D. 𝑓(2.5) = 2
E. 𝑓 is bijective
Choose the correct answer from the options given below:
A C. E only C A, B only
B B, C, D only D C, D only
Question
Let R be an equivalence relation on the set A = {1,2,3,4,5} given by R = {(𝑥, 𝑦) ⋅ 2
divides (𝑥 − 𝑦)}. Then equivalence class of 3 is :
A {1,5}
B {1,3,5}
C {3,5}
D {2,4}
Question
The relation 𝑅 = {(1,1), (2,2), (3,3)} on the set {1,2,3} is :
A symmetric only
B reflexive only
C transitive only
D an equivalence relation
Question
The greatest integer function f: R → R given by f(𝑥) = [𝑥] is :
A one-one but not onto
B onto but not one-one
C one-one and onto
D neither one-one nor onto
Question
For a set 𝐴 = {1,2,3}, the following functions are defined from 𝐴 to 𝐴. Which of these
functions has an inverse?
A 𝑓1 = {(1,1), (2,2), (3,3)}
B 𝑓2 = {(1,1), (1,2), (3,3)}
C 𝑓3 = {(1,2), (2,3), (3,2)}
D 𝑓4 = {(1,3), (2,3), (3,1)}
Question
2𝑥−1
If a function 𝑓: 𝑄 → ℝ is defined by 𝑓(𝑥) = and 𝑔: 𝑄 → ℝ is defined by 𝑔(𝑥) =
2
3
𝑥 + 2, then (𝑔 ∘ 𝑓) is:
2
A 1
B 2
C 7
2
D 3
Question
3 3𝑥−2
If A = ℝ − and function 𝑓: A → A is defined by 𝑓(𝑥) = , then
2 2𝑥−3
A 𝑓 −1 (𝑥) = 𝑓(𝑥)
B 𝑓 −1 (𝑥) = −𝑓(𝑥)
C 𝑓 ∘ 𝑓(𝑥) = −𝑥
3𝑥+2
D 𝑓 −1 (𝑥) =
2𝑥+3
Question
For real numbers 𝑥 and 𝑦 the relation R is defined as R = {(𝑥, 𝑦): 𝑥 + 𝑦 − 𝜋 is an
irrational number }, then the relation R is
A reflexive
B symmetrie
C transitive
D equivalence
Question
If 𝑓: [3, ∞) → A defined by f(𝑥) = 𝑥 2 is an onto function, then A is :
C
A 𝐑
B [5, ∞)
C [6, ∞)
D [9, ∞)
Question
If a function 𝑓: 𝐑 → 𝐑 is defined by 𝑓(𝑥) = 𝑥 2 + 1, then the pre images of 17 and -3
nespectively are:
A $, [4, −4]
B [3, -3], 𝜙
C [4, −4], 𝜙
D [4, −4], (2, −2)
Question
The relation 𝑅 on the set 𝐴 = {1,2,3,4,5}, given by 𝑅((𝑎, 𝑏): |𝑎 − 𝑏| is even}, is :
A Reflexive only
B Reflexive and symmetric only
C Symmetric and Transitive only
D Equivalence
Question
2𝑥
Let 𝑓: [0, ∞) → [0,2] be defined by 𝑓(𝑥) = , then 𝑓 is :
1+𝑥
A one one but not onto
B onto but not one one
C both one one and onto
D neither one one nor onto
Question
The relation R in the set {1,2,3} given by R = {(1,1), (2,2), (3,3), (1,2), (2,3)} is :
A Reflexive only
B Symmetric only
C Transitive only
D Equivalence
Question
Match List I with List II
LIST I LIST II
A A-I, B-III, C-II, D-IV
Signum
A. 𝑓: R → R 𝑓(𝑥) = [𝑥] I.
function
B A-II, B-I, C-III, D-IV
Identity
B. 𝑓: R → R 𝑓(𝑥) = 𝑥 II.
function
C A-II, B-IV, C-I, D-III
Greatest
C. 𝑓: R → R 𝑓(𝑥) = 𝑥 III. Integer
D A-III, B-IV, C-II, D-I
function
−1 if 𝑥<0 Modulus
D. 𝑓: R → R 𝑓(𝑥) = ቐ 0 if 𝑥=0 IV.
function
1 if 𝑥>0
Choose the correct answer from the options given below :
Question
Let 𝑅 be the relation on N (set of Natural numbers) defined by R = {(a, b): a, b ∈ N and
b is drvisible by a}. Then the relation 𝑅 is
A Reflexive, symmetric bat not Transitive.
B Reflexive, Transitive bet not symmetric.
C Not Reflexive, not transitive, not symmetric.
D Equivalence relation.
Question
Let 𝑅 be a relation on the set of natural numbers 𝑁 defined by 𝑛𝑅𝑚 if 𝑛 divides 𝑚.
Then 𝑅 is :
(A) Reflexive Relation
(B) Symmetric Relation
(C) Transitive Relation
(D) Identity Relation
Choose the correct answer from the options given below :
A (A) and (C) Only
B (A) and (B) Only
C (A) and (D) Only
D (B) and (C) Only
Question
Match List - I with List - II.
List – I List - II
1
(A) 𝑓(𝑥) = , 𝑓: 𝐑 − {0} → 𝐑 − {0} (I) neither injective nor surjective
𝑥
(B) 𝑓(𝑥) = 𝑥 2 , 𝑓: N → N (II) surjective but not injective
(C) 𝑓(𝑥) = 𝑥 2 , 𝑓: 𝐑 → 𝐑 (III) injective but not surjective
(D) 𝑓: {1,2,3} → {1,2} defined as 𝑓: {(1,1), (2,2), (3,1)} (IV) injective and surjective
Choose the correct answer from the options given below :
A (A)-(IV), (B)-(I), (C)-(II), (D)-(III) B (A)-(III), (B)-(IV), (C)-(I), (D)-(II)
C (A)-(II), (B)-(III), (C)-(IV), (D)-(I) D (A)-(IV), (B)-(III), (C)-(I), (D)-(II)
Question
The maximum number of equivalence relations on the set A = {a, b, c} is :
A 1
B 2
C 5
D 3
Question
Let * be a binary operation on set 𝑄 of rational numbers given by 𝑎 + 𝑏 = 𝑎 + 𝑏 + 𝑎𝑏.
Then identity element is:
A –1
B 0
C 1
2
D 1
Question
Let 𝐴 = {1,2,3} and 𝑅 = {(1,1), (1,3), (3,1), (2,2), (2,1), (3,3)} be a relation on 𝐴.
Then, 𝑅 is :
A Reflexive
B Both Reflexive and Symmetric
C Symmetric but not Reflexive
D Both Reflexive and Transitive
Question
If 𝑓: R → R is defined by 𝑓 𝑥 = sin 𝑥 + 𝑥, then 𝑓(𝑓(𝑥)) is:
A 2sin 𝑥 + 2𝑥
B sin2 𝑥 + 𝑥 2
C sin sin 𝑥 + 𝑥 + sin 𝑥 + 𝑥
D sin2 𝑥 + 2sin 𝑥 + 𝑥
Question
If 𝑓: R → R is defined by 𝑓 𝑥 = sin 𝑥 + 𝑥, then 𝑓(𝑓(𝑥)) is:
A 2sin 𝑥 + 2𝑥
B sin2 𝑥 + 𝑥 2
C sin sin 𝑥 + 𝑥 + sin 𝑥 + 𝑥
D sin2 𝑥 + 2sin 𝑥 + 𝑥
Question
Let 𝑓: R → R be defined as 𝑓(𝑥) = 3𝑥 + 4. Choose the correct answer.
A 𝑓 is injective and surjective
B 𝑓 is many-one and onto
C 𝑓 is injective and into
D 𝑓 is neither injective nor surjective
Question
Number of one - one functions from A = {1,2,3,4} to itself is:
A 6
B 24
C 14
D 10
Question
The relation 𝐑 = {(a, b); both a and b are either odd or even} on the set {1,2,4,5,7,8} is
A reflexive and symmetric bot not transitive
B reflexive and transitive but not symmetric
C symmetric and transitive but not reflexive
D an equivalence relation
Question
The relation R = {(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)} on the set A = {1,2,3} is :
A Reflexive but not Symmetric
B Reflexive but not Transitive
C Symmetric and Transitive
D Neither Symmetric nor Transitive
Question
Consider 𝑓: 𝐑+ → [4, ∞) given by 𝑓(𝑥) = 𝑥 2 + 4 (where 𝐑+ is set of non negative real
numbers) then 𝑓 −1 (𝑥) is :
A 𝑥2 + 4
B ± 𝑥+4
C 𝑥−4
D 𝑥2 − 4
Question
Let 𝑅 be the relation in the set {𝑎, 𝑏, 𝑐} given by 𝑅 =
{(𝑎, 𝑏), (𝑏, 𝑏), (𝑎, 𝑎), (𝑎, 𝑐), (𝑐, 𝑐), (𝑐, 𝑏)} Choose the correct answer from the options
below :
A R is symmetric and transitive but not reflexive
B 𝑅 is reflexive and symmetric but not transitive
C 𝑅 is reflexive and transitive but not symmentric
D R is equivalence relation
Question
If f: 𝐑 → 𝐑 is defined by 𝑓(𝑥) = 4 − 𝑥 2 1/2 , then 𝑓 ∘ 𝑓(𝑥) is :
A |𝑥|
B 2|𝑥|
C 𝑥2
D 0
Question
Which of the following functions is onto ?
A 𝑓: R → R, 𝑓(𝑥) = 𝑥 2
B 𝑓: R → R, 𝑓(𝑥) = 𝑥 2 + 1
C 𝑓: R → R, 𝑓(𝑥) = 𝑥 2 − 1
D 𝑓: R → R, 𝑓(𝑥) = 2𝑥 + 1
CUET PYQs
Match List I with List II
Q.
Choose the correct answer from the options given below:
LIST – I List – II
A R ={ 𝐱, 𝐲 : x and y are I. Symmetric
A A – I, B – IV, C – II, D – III student of the same
school}
B R = { 𝐋𝟏 , 𝐋𝟐 : 𝐋𝟏 ⊥ II. One-one
B A – IV, B – I, C – III, D – II 𝐋𝟐 , 𝐋𝟏 𝐋𝟐 ∈ 𝐋, where L is a
set of all lines}
C A – I, B – IV, C – III, D – II C A function f : R → R III. Bijective
defined by f(x) = 2-3x is
D A function f: [0, 1] →R IV. Equivalence
D A – IV, B – I, C – II, D – III
defined by f(x) = 1 + 𝐱 𝟐 is
f : [0, 1] → R
CUET PYQs
Q. If R is a relation on Z (set of all integers) defined by xRy, iff 𝒙 − 𝒚 ≤
𝟏, then:
(a) R is reflexive (b) R is symmetric
(c) R is transitive (d) R is not symmetric
(e) R is not transitive
Choose the most appropriate answer from the options given below:
(1) (a) and (d) only (2) (a), (b) and (c) only
(3) (b) and (c) only (4) (a), (b) and (e) only
A 𝟏 B 𝟑
C 𝟐 D 𝟒
CUET PYQs
Q. Which of the following is true on the basis of above diagram?
(1) ‘f’ is a function from A → B.
(2) ‘f’ is one-one function from A → B.
(3) ‘f’ is onto function from A → B.
(4) ‘f’ is not a function from A → B. 1
A 2
B 3
C 4
A 𝟏 B 𝟑
C 𝟐 D 𝟒
CUET PYQs
Q. Let A = {1, 2, 3, 4}. If a relation R on A is defined as R = {(1,1), (1, 2),
(2, 3), (3, 3), (2, 1), (2, 2) (3, 2), (4, 4), then R is:
A. Reflexive
B. Symmetric
C. Transitive
D. Equivalence
Choose the correct option from options given below
A 𝑨 𝒂𝒏𝒅 𝑩 𝒐𝒏𝒍𝒚 B 𝑨 𝒂𝒏𝒅 𝑪 𝒐𝒏𝒍𝒚
C 𝑩 𝒂𝒏𝒅 𝑪 𝒐𝒏𝒍𝒚 D 𝑫 𝒐𝒏𝒍𝒚
CUET PYQs
Q. The modulus function 𝑓: 𝑅 → 𝑅, given by 𝑓 𝑥 = 𝑥 , is:
1 One-one
2 Onto
3 One-one and onto both
4 Neither one-one nor onto
CUET PYQs
Q. Let L be the set of all lines in a plane and R be the relation in L defined as =
{(𝑙1 , 𝑙2 ) : 𝑙1 is perpendicular to 𝑙2 where 𝑙1 𝑙2 ∈ 𝐿}. Choose the correct answer:
1 R is reflexive relation
2 R is symmetry relation
3 R is transitive relation
4 R is equivalence relation
CUET PYQs
Q.
Let L be the set of all lines in XY plane and R be an equivalence
relation defined by R 𝒍𝟏 , 𝒍𝟐 : 𝒍𝟏 ∥ 𝒍𝟐 ⊆ 𝑳 × 𝑳 . Then which of the following
line is related to the line 𝒚 = 𝟑𝒙 + 𝟐 ?
A 𝒚 = 𝟐𝒙 + 𝒌, where k is constant
B 𝒚 + 𝟑𝒙 + 𝒌, where k is constant
C 𝒚 = 𝟑𝒙 + 𝒌, where k is constant
D 𝒙 = 𝟑𝒚 + 𝒌, where k is constant
CUET PYQs
Q.
A relation R is defined on a set A= 𝟏, 𝟐, 𝟑 𝒃𝒚 𝑹 = 𝟏, 𝟐 , 𝟐, 𝟏 , 𝟏, 𝟏 , 𝟐, 𝟐 .
Then, which of the following is correct?
A R is reflexive and symmetric.
B R is symmetric and transitive.
C R is reflexive and transitive
D R is an equivalence relation.
CUET PYQs
Q. Consider the non-empty set consisting of children in a family and a relation R defined as aRb if a
is brother of b. Then R is:
𝑆𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑏𝑢𝑡 𝑛𝑜𝑡 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒
𝑇𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 𝑏𝑢𝑡 𝑛𝑜𝑡 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐
𝑁𝑒𝑖𝑡ℎ𝑒𝑟 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑛𝑜𝑟 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒
𝐵𝑜𝑡ℎ 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑎𝑛𝑑 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒
CUET PYQs
Q. The relation R in the set {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)} is:
𝑅𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 𝑜𝑛𝑙𝑦
𝑅𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 𝑎𝑛𝑑 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑦 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛
𝑇𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 𝑜𝑛𝑙𝑦
𝐸𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛
Q. CUET PYQs
If 𝑓: 𝑅 − −1 → 𝑅 − {1} be a function defined by
𝑥−1
𝑓 𝑥 = , then:
𝑥+1
i. f is one-one but not onto.
ii. f is onto but not one-one.
iii. f is one-one and onto.
x−1
iv. f x = 𝑖, 𝑖𝑣, 𝑣 𝑜𝑛𝑙𝑦
x+1
1
v. fox x = − ; x ≠ 0, –1
x
𝑖𝑖𝑖, 𝑖𝑣 𝑜𝑛𝑙𝑦
𝑖𝑖, 𝑣 𝑜𝑛𝑙𝑦
𝑖𝑖𝑖, 𝑣 𝑜𝑛𝑙𝑦
CUET PYQs
Let R be the relation in the set A = {a, b, c, d} given by R = {(a, a), (b, b), (c, c), (a, b), (b, a), (c,
Q.
d), (d, d), (d, c)}
𝑅 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 𝑎𝑛𝑑 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑏𝑢𝑡 𝑛𝑜𝑡 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒
𝑅 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 𝑎𝑛𝑑 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 𝑏𝑢𝑡 𝑛𝑜𝑡 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐
𝑅 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑎𝑛𝑑 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 𝑏𝑢𝑡 𝑛𝑜𝑡 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒
𝑅 𝑖𝑠 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛
CUET PYQs
Q.
The function f : A → B defined by f(x) = 4x + 7, x ∈ R is
(a) one-one
(b) Many-one
(c) Odd
(d) Even
A 𝑨 𝒂𝒏𝒅 𝑩 𝒐𝒏𝒍𝒚 B 𝑨 𝒂𝒏𝒅 𝑪 𝒐𝒏𝒍𝒚
C 𝑨 𝒐𝒏𝒍𝒚 D 𝑫 𝒐𝒏𝒍𝒚
CUET PYQs
Q. The smallest integer function f(x) = [x] is
(a) One-one
(b) Many-one
(c) Both (a) & (b)
(d) None of these
CUET PYQs
Q.
The function f : R → R defined by f(x) = 3 – 4x is
(a) Onto
(b) Into function
(c) one-one function
(d) Bijective
A 𝑨 𝒂𝒏𝒅 𝑪 𝒐𝒏𝒍𝒚 B 𝑨 𝒂𝒏𝒅 𝑪, 𝑫 𝒐𝒏𝒍𝒚
C 𝑩 𝒂𝒏𝒅 𝑪 𝒐𝒏𝒍𝒚 D B 𝒐𝒏𝒍𝒚
CUET PYQs
Q.
Let us define a relation R in R as aRb if a ≥ b. Then R is
(a) an equivalence relation
(b) reflexive, transitive but not symmetric
(c) symmetric, transitive but not reflexive
(d) neither transitive nor reflexive but symmetric
CUET PYQs
Q. Let S = {1, 2, 3, 4, 5} and let A = S × S. Define the relation R on A
as follows: (a, b) R (c, d) iff ad = cb. Then, R is
(a) reflexive only
(b) Symmetric only
(c) Transitive only
(d) Equivalence relation
A 𝑨 𝒂𝒏𝒅 𝑩 𝒐𝒏𝒍𝒚 B 𝑨 𝒂𝒏𝒅 𝑪 𝒐𝒏𝒍𝒚
C 𝑩 𝒂𝒏𝒅 𝑪 𝒐𝒏𝒍𝒚 D A,B,C, 𝑫 𝒐𝒏𝒍𝒚
CUET PYQs
Q. Let g(x) = x2 – 4x – 5, then
(a) g is one-one on R
(b) g is not one-one on R
(c) g is bijective on R
(d) None of these
CUET PYQs
Q.
The mapping f : N → N is given by f(n) = 1 + n2, n ∈ N when N
is the set of natural numbers is
(a) one-one and onto
(b) onto but not one-one
(c) one-one but not onto
(d) neither one-one nor onto
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
A={1,2,3}
Relation containing (1,2) and (1,3)
For symmetricity, (1,2),(2,1),(1,3) and (3,1) must be included.
For reflexivity,(1,1),(2,2),(3,3) must be included.
⇒ Only one set is there R={(1,1),(1,2),(1,3),(2,2),(2,1),(3,3),(3,1)}
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
A={1,2,3}
For equivalence relation containing (1,2)
For symmetric, it must consists (1,2) and (2,1).
For transitivity, it must consists (1,3) and (3,2) and (1,2),(2,1),(2,3),(3,1)
For reflexivity, it must consists (1,1) and (2,2),(3,3)
⇒R={(1,1),(2,2),(2,3),(3,3),(1,2)(1,3),(2,1),(3,1),(3,1)}
⇒ Only 1 such relation is possible.
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
Here, O(A)=m and O(B)=n.
Hence O(A×B)=mn
Since every subset of A×B is a relation from A to B, therefore,
number of relations from A to B is equal to the number of the subsets
of A×B, i.e., 2mn
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
CUET MATHEMATICS DOMAIN – RELATIONS AND FUNCTIONS
