Worksheet Functions
Worksheet Functions
Subject: Mathematics
Functions
S. No.
1 Set A has 3 elements and set B has 4 elements. Then the
number of injective mappings that can be defined from A to B is:
A)144 B) 12 C) 24 D) 64
2 Let A = {𝑥 ∈ 𝑅: − 1 ≤ 𝑥 ≤ 1} = B and C = {𝑥 ∈ 𝑅 ∶ 𝑥 ≥ 0} .
Further let S = {(𝑥, 𝑦) ∈ 𝐴 × 𝐵: 𝑥 ! + 𝑦 ! = 1} and
P = {(𝑥, 𝑦) ∈ 𝐴 × 𝐶: 𝑥 ! + 𝑦 ! = 1}
(A) S defines a function from A to B
(B) P defines a function from A to B
(C) S defines a function from A to C
(D) P defines a function from A to C
3 2𝑥 ; 𝑥>3
Let 𝑓: 𝑅 → 𝑅 be defined by 𝑓(𝑥) = :𝑥 ! ; 1<𝑥≤3
3𝑥 ; 𝑥≤1
Then , 𝑓(−1) + 𝑓(2) + 𝑓(4) is :
(A) 9 B) 14 C) 5 D) none of these
4 Let 𝑓: 𝑅 → 𝑅 be defined by 𝑓(𝑥) = 𝑐𝑜𝑠[𝜋]𝑥 + 𝑐𝑜𝑠[−𝜋]𝑥 for all
"
𝑥 ∈ 𝑅, then the value of 𝑓( ! ) is :
A) 0 B) -1 C) 1 D) 2
5 Let 𝑓: [2, ∞) → 𝑅 be the function defined by 𝑓(𝑥) = 𝑥 ! − 4𝑥 + 5
then the range of 𝑓 is :
(A) R (B) [4, ∞)
(C) [1, ∞) (D) [5, ∞)
6 Let 𝑓: 𝑅 → 𝑅 be defined by 𝑓(𝑥)= 𝑥 ! + 1. Then pre-image of 17
and -3 , respectively are :
(A) ∅, {−4,4} (B) {-3,3} , ∅
(C) {−4,4},∅ (D) {−4,4},{−2,2}
7 #$|# |
The equivalent definition of 𝑓: 𝑅 − {0} → 𝑅 given by 𝑓(𝑥) = |#|
is :
(A) 𝑓(𝑥) = 0 for all 𝑥 ∈ 𝑅 − {0}
(B) 𝑓(𝑥) = −2 for all 𝑥 ∈ 𝑅 − {0}
0 ,𝑥 > 0
(C) 𝑓(𝑥) = J
−2 , 𝑥 < 0
0 ,𝑥 > 0
(D) ) 𝑓(𝑥) = J
2 ,𝑥 < 0
A) 720 B) 120 C) 65 D) 56
9 If the set A contains 5 elements and set B contains 6 elements,
then the number of one-one and onto mappings from A to B is :
A) 720 B) 120 C) 0 D) none of these
10 Let there be a set S consisting of n elements. Then , the number
of functions SXS to S is:
!
A) 𝑛! B) 𝑛& C) 𝑛& D) 𝑛!&
11 Show that the function 𝑓: 𝑅' → [−9, ∞) given by
𝑓(𝑥) = 5𝑥 ! + 6𝑥 − 9. Show that 𝑓 is bijective.
12 If 𝑓: 𝑅 → 𝑅 be defined by 𝑓(𝑥) = 𝑥 ( - 3 , then prove that f is
bijective. Hence find 𝑓(𝑥) = 24 and 𝑓(𝑥) = 5.
17 Let 𝑓 be a function from R to R such that 𝑓(𝑥) = cos (𝑥 + 2) . Is
𝑓 bijective? Justify your answer.
18 Let A and B be two sets each with finite number of elements.
Assume that there is an injective map from A to B and there is
an injective map from B to a . Prove that there is a bijection from
A to B.
19 Let 𝑓: 𝑊 → 𝑊 be defined as
𝑛 − 1 , 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑
𝑓(𝑛) = R
𝑛 + 1 , 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛
Show that 𝑓 is bijective. Here , W is the set of all whole
numbers.