 Math 1

s
CHAPTER-1
RELATIONS & FUNCTIONS

MOCK TEST

1. The relation R defined on the set of natural numbers as {(a, b) : a differs from b by 3}, is

given by

(A) {(1, 4, (2, 5), (3, 6),.....} (B) {(4, 1), (5, 2), (6, 3),.....}

(C) {(1, 3), (2, 6), (3, 9),..} (D) None of these

2. Let n(A) = n. Then the number of all relations on A is

2
n (n)! n
(A) 2 (B) 2 (C) 2 (D) None of these

3. A relation R is defined from {2, 3, 4, 5} to {3, 6, 7, 10} by xRy  x is relatively prime to y.

Then domain of R is

(A) {2, 3, 5} (B) {3, 5} (C) {2, 3, 4} (D) {2, 3, 4, 5}

4. Let A be the non-void set of the children in a family. The relation x' is a brother of y' on A is

(A) Reflexive and symmetric (B) Symmetric and transitive

(C) Reflexive and Transitive (D) None of these

5. Function f : R  R, f (x)  x 2  x is

(A) One-one onto (B) One-one into (C) Many-one onto (D) Many-one into

6. Mapping f : R  R which is defined as f (x)  cos x, x R will be

(A) Neither one-one nor onto (B) One-one

(C) Onto (D) One-one onto

7. The function f : R  R defined by f (x)  (x  1) (x  2)(x  3) is

(A) One-one but not onto (B) Onto but not one-one

(C) Both one-one and onto (D) Neither one-one nor onto

8. The function f : R  R defined by f (x)  e x is

E
2 Relations and 
Functions
(A) Onto (B) Many-one (C) One-one and into (D) Many one and onto

ASSERTION & REASON

9. The following question consists of two statements, one labelled as 'Assertion (A)' and the other
labelled as 'Reason (R)'. You have to examine these two statements carefully and decide if the
Assertion (A) and the Reason (R) are individually true and if so, whether the reason (R) is a
correct explanation for the given Assertion (A). Select your answer to these items using the
codes given below and then select the correct option:
 x2
Assertion (A): The function f: A  B defined by f(x) =   ; where A R – {3} and
 x3
B  R – {1}, is a bijective function.
Reason (R): Any function f is a bijective function; if it is one-one (injective) but not onto
(surjective).
Codes:
(A) Both A and R are correct and R is the correct explanation for A
(B) Both A and R are correct but R is not the correct explanation for A
(C) A is correct; R is incorrect
(D) R is correct; A is incorrect
10. CASE STUDY
 The Case study-based questions are compulsory.
 Attempt any 4 sub parts from each questions (i) to (v).
 Each question carries 1 mark.
An organization conducted bike race under two different categories-boys and girls. Totally there
were 250 participants. Among all of them finally three from Category 1 and two from Category 2
were selected for the final race. Ravi forms two sets B and G with these participants for his
college project.
Let B = {b1, b2, b3}; G = {g1, g2} where B represents the set of boys selected and G the set of
girls who were selected for the final race.

E
  Math 3

Ravi decides to explore these sets for various types of relations and functions.
Based on the above information, answer the following:
(i) Ravi wishes to form all the relations possible from B to G. How many such relations are
possible?
(A) 26 (B) 25 (C) 0 (D) 23
(ii) Let R : B B be defined by R = {(𝑥, 𝑦) : 𝑥 and y are students of same sex}, Then this relation R
is_______
(A) Equivalence (B) Reflexive only
(C) Reflexive and symmetric but not transitive (D) Reflexive and transitive but not symmetric
(iii) Ravi wants to know among those relations, how many functions can be formed from B to G?
(A) 22 (B) 212 (C) 32 (D) 23
(iv) Let R: 𝐵 𝐺 be defined by R = {(b1, g1), (b2, g2), (b3, g1)}, then R is__________
(A) Injective (B) Surjective
(C) Neither Surjective nor Injective (D) Surjective and Injective
(v) Ravi wants to find the number of injective functions from B to G. How many numbers of
injective functions are possible?
(A) 0 (B) 2! (C) 3! (D) 0!

E
4 Relations and 
Functions
SOLUTIONS
1. (B)
R  {(a, b) : a, b  N,a  b  3}  {((n  3), n) : n  N}
 {(4,1),(5, 2),(6,3),.....} .

2. (C)
Number of relations on the set A = Number of subsets of A  A  2n , [ n(A  A)  n 2 ] .
2

3. (D)
Given, xRy  x is relatively prime to y.
 Domain of R  {2,3, 4,5} .
4. (B)
x is a brother of y, y is also brother of x.
So, it is symmetric. Clearly, it is transitive.
5. (D)
f (0)  f (1)  0 hence f(x) is many-one. But there is no pre-image of  1 . Hence f (x) is into
function. So function is many-one into.
6. (A)
Let x1 , x 2  R, then f (x1 )  cos x1 , f (x 2 )  cos x 2 , so f (x1 )  f (x 2 )
 cos x1  cos x 2  x1  2n  x 2

 x1  x 2 , so it is not one-one.
Again the value of f-image of x lies in between –1 to 1
 f[R]  f (x) : 1  f (x)  1)
So other numbers of co-domain (besides –1 and 1) is not
f-image. f[R]  R, so it is also not onto. So this mapping is
neither one-one nor onto.
7. (B)
We have f (x)  (x 1)(x  2)(x  3)
and f (1)  f (2)  f (3)  0  f (x) is not one-one.
For each y  R , there exists x  R such that f (x)  y . Therefore, f is onto.
Hence f : R  R is onto but not one-one.
8. (C)
Function f : R  R is defined by f (x)  e x . Let x1 , x 2  R and f (x1 )  f (x 2 ) or ex1  ex2 or
x1  x 2 . Therefore, f is one-one. Let f (x)  e x  y . Taking log on both sides, we get x  log y .

E
  Math 5

s zero is
We know that negative real numbers have no pre-image or the function is not onto and
not the image of any real number. Therefore, function f is into.
9. (C)
Let x1, x2 A be such that f(x1) = f(x2)
 f(x1) = f(x2)
x  2 x2  2
 1 
x1  3 x2  3
 (x1 – 2) (x2 – 3) = (x2 – 2) (x1 – 3)
 x1x2 – 2x2 – 3x1 + 6 = x1x2 – 2x1 – 3x2 + 6
 x2 = x1
f is one-one.
Let y B = R – {1}, then f(x) = y
x2
if = y, x 3
x3
i.e., if x – 2 = yx – 3y
i.e., if x – xy = 2 – 3y
i.e., if x(1 – y) = 2 – 3y
2  3y
i.e., if x  A (where y  1)
1 y
Hence, f is onto.
Hence, Assertion is correct and Reason is incorrect.
10.
(i) (A)
Let the relation R be defined from set B to set G.
 Number of such possible relations = 23 × 2 = 26
[There are 2mn subsets and hence 2mn relations between sets E and F containing 'm' and 'n'
elements, respectively]
(ii) (A)
Given, R : B  B defined by :
R = {(x, y) : x and y are students of same sex}
Reflexive :
Let x  B.
If R is reflexive, then (x, x)  R
which means, x and x are students of the same sex, which is true.
Hence, R is reflexive.

Symmetric :
Let x, y  B
Now; if (x, y)  R
 x and y are students of same sex
or y and x are also students of the same sex.

E
6 Relations and 
Functions
 (x,y)  R (y, x)  R
Hence; R is symmetric
Transitive :
Let x,y,z  B
Now; if (x,y) R
  x and y are students of the same sex.
and if (y, z) R
  y and z are students of the same sex
  x and z will also be students of the same sex
 (x, z)  R
Hence, R is transitive
R is an equivalence relation
(iii) (D)
Number of functions that can be formed from set B to set G will be : 23 = 8
[Total number of functions that can be defined from set X, containing 'm' elements to set Y,
containing 'n' elements; will be n × n × n × n........m times = nm]
(iv) (B)
R : B  G given by :
R = { (b1, g1), (b2, g2) (b3, g1)}
The relation given above, which is defined from set B to set G, will be a function as each element
of set B (domain) is uniquely associated to some element of set G (co-domain)
For one-one function; we see that two distinct elements b1 and b3 have the same image g1 under
the mentioned function.
Hence; it is not one-one or injective
Also, the function will be surjective or onto function as the range and co-domain contain same
elements, i.e., Range = Co-domain
(v) (A)
We know that if A and B are two sets having 'm' and 'n' elements respectively, then the total
number of possible one-one or injective functions from A to B is :
n
cm × m! [if m  n]
or 0 [if m > n]
In our case, we have to find the possible number of injective functions from B
(containing 3 elements) to G (containing 2 elements)
Since; 3 > 2 (or m > n)
Hence; the answer is zero.