1

IIT JAM Biotechnology PCM Combo

Functions DPP-01

1. If a function ‘f : A → B’ is both injective (one-to-one) 6. Let R be the set of all real numbers and a function
and surjective (onto), how is it classified? f : R → R be defined by f(x) = ax + b, where a, b are
(1) Surjective alone constants and a ≠ 0. is f invertible? If it is so, find the
(2) Injective alone inverse of f.
(3) Non-Bijective x−b
(1) Inverse of f exists and f −1 ( x ) =
(4) Bijective a
(2) f is one-to-one but not onto
2. What is the correct term for a function which maps a (3) The inverse of f does not exist
set to itself? (4) f is onto but one-to-one
(1) Surjective Function
(2) Self-Map 7. Which one of the following function f : R → R is
(3) Injective Function injective?
(4) Bijective Function (1) f(x) = |x|, x ∈ R
(2) f(x) = –x, x ∈ R
3. Which of the following is true? (3) f(x) = x2, x ∈ R
I. F(x) = x2 where F : N → N (4) f(x) = c, x ∈ R
II. F(x) = x + 1 where F : Z → Z
Where Z = integers, N = Natural numbers,
(1) Both are Injective and surjective
(2) I is Injective and II surjective
(3) His surjective and II is not Injective
(4) Both are not injective and surjective

4. The domain of function log (log sin (x)) is

(1) 0 < x < π
(2) 2nπ < x < (2n + 1) π, for n in N
(3) Empty set
(4) None of the above

5. Set P has 4 elements and set Q has 5 elements. How

many numbers of injections are defined from P to Q?
(1) 24 (2) 96
(3) 480 (4) 120
 2

Answer Key
1. (4)
2. (2)
3. (2)
4. (3)
5. (4)
6. (1)
7. (2)
 3

Hint and Solutions

1. (4)
Given:
The conditions for a certain type of function,
namely that it is both injective and surjective.
Concept used:
A bijective function is a function that is both
injective (one-to-one) and surjective (onto).
Injective means Every element of domain has a
preimage in Codomain and it should be unique.
Surjective means No element of Codomain left
without preimage
Calculation:
I. F(x) = x2 where F : N → N
By the defination “f : A → B” is both injective (one-
It is an Injective function because every
to-one) and surjective (onto) This type of function
element of X has an X2 value in the Natural
is classified as a “Bijective function”.
number. But In the codomain, some elements
Hence, Option (4) is correct
do not have an in a domain like 2,3,5… etc. So
it is an Injective function but not a subjective
2. (2)
function.
Given:
II. F(x) = x + 1 where F : Z → Z
Our options represent various function types
It is an Injective function because every
Concept used:
element of X has an X + 1 value in the Integers
A self-map, or endofunction, is a function whose
system and in the codomain, every X + 1 has
domain is equal to its codomain.
X – 1 in the domain. So it is an Injective
Calculation:
function and subjective function.
Self Map having image equal to it pre image
Hence the correct answer is I is Injective and
Only option (2) aptly represents a function that
II is surjective.
maps to itself - a Self-Map
Hence, Option (2) is Correct.
4. (3)
General points:
3. (2)
• sin (x) is the function having a range between
• Injective function (also known as injection, or
-1 and +1.
one-to-one function) is a function F that maps
distinct elements to distinct elements; that is, • log (x) is defined only when x is positive and
F(x1) = F(x2) implies x1 = x2. In other words, greater than zero.
every element of the function's codomain is log (sin (x)) is defined only when 0 < sin (x) ≤ 1,
the image of at most one element of its and then range will be (–∞, 0]
domain. So, log [log (sin (x))] is undefined as the logarithm
of non-positive numbers isn't defined for real
• Surjective function (also known as surjection,
numbers.
or onto function) is a function F that maps an
Hence, Domain of log [log (sin (x))]:∅ (empty set)
element x to every element y; that is, for every
y, there is an x such that F(x) = y. In other Also, Range of log [log (sin (x))]:∅ (empty set)
words, every element of the function's
codomain is the image of at least one element 5. (4)
Concept:
of its domain.
If set P has m elements and set Q has n elements,
then the number of injections from set P to Q is
n!
n
Pm = !.
(n − m)
Calculation:
 4

Given, Set P has 4 elements and set Q has 5 7. (2)

elements Function:
⇒ The numbers of injections are defined from P A function is a relation between a set of inputs and
5! a set of permissible outputs with the property that
to Q =5 P4 = !
(5 − 4) each input is related to exactly one output. Let A &
B be any two non-empty sets, mapping from A to B
⇒ The numbers of injections are defined from P will be a function only when every element in set A
to Q = 5! = 120 has one end only one image in set B.
Alternative method:
If we consider one functions from set P to Q, the
first element has 5 choices, and since the function 1 P 1 P
is one to one, the second element has 4 choices,
accordingly third has 3 and the fourth element has 2 Q 2 Q
2 choices. R 3 R
3
So the total number of injective functions = 5 × 4 ×
3 × 2 = 120
∴ The correct option is (4).
An injective function means one-one.
6. (1) Consider f(x) = –x
Here the function f : R → R is defined as f(x) = ax Let f(x) = f(y) ∀ x, y ∈ R
+ b = y (say). ⇒ –x = –y ⇒ x = y
y−b For every value of x, we get a different value of f.
Then ax = y – b or x = , where a, b are Hence, it is injective.
a
Additional Information
constants and a ≠ 0
One - One function (Injective function)
This leads to a function g : R → R defined as
If each element in the domain of a function has a
y−b
g ( y) = distinct image in the co-domain, the function is said
a to be one-one function.
Therefore, (gof) (x) = g(f(x)) = g(ax + b) For examples f ; R R given by f(x) = 3x + 5 is one -
ax + b − b one.
= =x
a
or gof = Ig 0 0
Similarly (fog)(y) = f(g(y))
0
 y−b  y−b
=f  = a +b= y 0 0
 a   a 
0
or fog = If
Hence f is invertible and f–1 = g which given by Set x Set y
x−b
f −1 ( x ) = Many to One
a Many - one function
On the other hand, if there are at least two elements
in the domain whose images are same, the function
is known as many to one.
For example f : RR given by f(x) = x2 + 1 is many
one.

PW Web/App - https://smart.link/7wwosivoicgd4
Library- https://smart.link/sdfez8ejd80if