Confirming your payment

Skip to content

Opening your dashboard

Class 12 Maths Chapter 1: Relation and Functions Solutions

28 textbook questions with step-by-step answers, free to read, for CBSE 2026-27.

Jump to an exercise

2 exercises in Ch 1

The numbered NCERT exercises, so you can open the one you were set rather than scrolling for it.

AI Tutor

Get talked through Ch 1, not just shown the answer

Reading a finished solution is not the same as being able to do it. The AI tutor takes one question at a time and works it with you, in your own words, until you can.

  • Ask it out loud, in your own words
  • It gives you the next step, not the answer
  • Stuck on part (ii)? Start there
Ch 1 solutions

28 questions with solutions

1–9 marks · Easy difficulty

The first 3 solutions are on this page. This chapter is a long one, so the rest open on their own page to keep this one quick to load.

Exercise 1.1

Open Exercise 1.1
  1. 1

    Question 1

    Determine whether each of the following relations are reflexive, symmetric and transitive:

    (i) Relation RR in the set A={1,2,3,…,13,14}A = \{1, 2, 3, \dots, 13, 14\} defined as R={(x,y):3x−y=0}R = \{(x, y) : 3x - y = 0\}

    (ii) Relation RR in the set N\mathbb{N} of natural numbers defined as R={(x,y):y=x+5 and x<4}R = \{(x, y) : y = x + 5 \text{ and } x < 4\}

    (iii) Relation RR in the set A={1,2,3,4,5,6}A = \{1, 2, 3, 4, 5, 6\} as R={(x,y):y is divisible by x}R = \{(x, y) : y \text{ is divisible by } x\}

    (iv) Relation RR in the set Z\mathbb{Z} of all integers defined as R={(x,y):x−y is an integer}R = \{(x, y) : x - y \text{ is an integer}\}

    (v) Relation RR in the set AA of human beings in a town at a particular time given by

    (a) R={(x,y):x and y work at the same place}R = \{(x, y) : x \text{ and } y \text{ work at the same place}\}

    (b) R={(x,y):x and y live in the same locality}R = \{(x, y) : x \text{ and } y \text{ live in the same locality}\}

    (c) R={(x,y):x is exactly 7 cm taller than y}R = \{(x, y) : x \text{ is exactly 7 cm taller than } y\}

    (d) R={(x,y):x is wife of y}R = \{(x, y) : x \text{ is wife of } y\}

    (e) R={(x,y):x is father of y}R = \{(x, y) : x \text{ is father of } y\}

    Easy
    9 marks
    Solve with AI
    Written solution

    (i) A={1,2,…,14}A = \{1, 2, \dots, 14\}, R={(x,y):3x−y=0}R = \{(x, y) : 3x - y = 0\}

    First write the condition as a rule. 3x−y=03x - y = 0 means y=3xy = 3x.

    So a pair (x,y)(x, y) belongs to RR exactly when yy is three times xx — and both xx and yy must lie in AA, because RR is a relation in AA.

    Take each xx in turn:

    • x=1⇒y=3x = 1 \Rightarrow y = 3, and 3∈A3 \in A, so (1,3)∈R(1, 3) \in R
    • x=2⇒y=6x = 2 \Rightarrow y = 6, and 6∈A6 \in A, so (2,6)∈R(2, 6) \in R
    • x=3⇒y=9x = 3 \Rightarrow y = 9, and 9∈A9 \in A, so (3,9)∈R(3, 9) \in R
    • x=4⇒y=12x = 4 \Rightarrow y = 12, and 12∈A12 \in A, so (4,12)∈R(4, 12) \in R
    • x=5⇒y=15x = 5 \Rightarrow y = 15, but 15∉A15 \notin A, so nothing is contributed; the same happens for every x≥5x \ge 5

    Hence

    R={(1,3),(2,6),(3,9),(4,12)}R = \{(1, 3), (2, 6), (3, 9), (4, 12)\}

    Reflexive? We need (x,x)∈R(x, x) \in R for every x∈Ax \in A. For (x,x)(x, x) the condition reads 3x−x=03x - x = 0, i.e. 2x=02x = 0, i.e. x=0x = 0 — and 0∉A0 \notin A. So not a single pair (x,x)(x, x) is in RR. For instance (1,1)∉R(1, 1) \notin R, because 3(1)−1=2≠03(1) - 1 = 2 \neq 0.

    Therefore RR is not reflexive.

    Symmetric? We need: whenever (x,y)∈R(x, y) \in R, also (y,x)∈R(y, x) \in R. Test the pair (1,3)∈R(1, 3) \in R. Is (3,1)∈R(3, 1) \in R? That needs 3(3)−1=03(3) - 1 = 0, but 3(3)−1=8≠03(3) - 1 = 8 \neq 0, so (3,1)∉R(3, 1) \notin R.

    One counterexample is enough. Therefore RR is not symmetric.

    Transitive? We need: whenever (x,y)∈R(x, y) \in R and (y,z)∈R(y, z) \in R, also (x,z)∈R(x, z) \in R. Here (1,3)∈R(1, 3) \in R and (3,9)∈R(3, 9) \in R, so transitivity would force (1,9)∈R(1, 9) \in R. But 3(1)−9=−6≠03(1) - 9 = -6 \neq 0, so (1,9)∉R(1, 9) \notin R.

    Therefore RR is not transitive.

    Conclusion. RR is neither reflexive, nor symmetric, nor transitive.

    The picture below shows the four pairs as arrows, together with the three arrows that are missing.

    Digraph of R = {(1,3),(2,6),(3,9),(4,12)} inside A = {1,

    (ii) N\mathbb{N}, R={(x,y):y=x+5 and x<4}R = \{(x, y) : y = x + 5 \text{ and } x < 4\}

    The condition x<4x < 4 restricts the first entry to x=1,2,3x = 1, 2, 3 (natural numbers only), and then y=x+5y = x + 5:

    • x=1⇒y=6x = 1 \Rightarrow y = 6
    • x=2⇒y=7x = 2 \Rightarrow y = 7
    • x=3⇒y=8x = 3 \Rightarrow y = 8

    So

    R={(1,6),(2,7),(3,8)}R = \{(1, 6), (2, 7), (3, 8)\}

    Reflexive? (a,a)∈R(a, a) \in R would need a=a+5a = a + 5, which is false for every aa. Also (1,1)∉R(1, 1) \notin R. So RR is not reflexive.

    Symmetric? (1,6)∈R(1, 6) \in R, but (6,1)∉R(6, 1) \notin R: it would need 1=6+51 = 6 + 5 (false) and 6<46 < 4 (also false). So RR is not symmetric.

    Transitive? Transitivity only says something when two pairs link up, i.e. when (x,y)∈R(x, y) \in R and (y,z)∈R(y, z) \in R for the same middle element yy. The second entries in RR are 6,7,86, 7, 8; the first entries are 1,2,31, 2, 3. No number is both, because a first entry must satisfy x<4x < 4. So there is no linked pair at all, and the condition "if ... then ..." has nothing to check.

    A statement of the form "if PP then QQ" is true whenever PP never happens — this is called vacuous truth. Therefore RR is transitive.

    Conclusion. RR is transitive, but neither reflexive nor symmetric.

    (iii) A={1,2,3,4,5,6}A = \{1, 2, 3, 4, 5, 6\}, R={(x,y):y is divisible by x}R = \{(x, y) : y \text{ is divisible by } x\}

    List, for each xx, the multiples of xx that lie in AA:

    R={ (1,1),(1,2),(1,3),(1,4),(1,5),(1,6),(2,2),(2,4),(2,6),(3,3),(3,6),(4,4),(5,5),(6,6) }\begin{aligned} R = \{\ &(1,1), (1,2), (1,3), (1,4), (1,5), (1,6), \\ &(2,2), (2,4), (2,6), \\ &(3,3), (3,6), \\ &(4,4), \\ &(5,5), \\ &(6,6)\ \} \end{aligned}

    That is 1414 pairs.

    Reflexive? Every number divides itself, since x=1⋅xx = 1 \cdot x. So (x,x)∈R(x, x) \in R for all six elements: (1,1),(2,2),(3,3),(4,4),(5,5),(6,6)∈R(1,1), (2,2), (3,3), (4,4), (5,5), (6,6) \in R.

    Therefore RR is reflexive.

    Symmetric? (2,4)∈R(2, 4) \in R because 4=2×24 = 2 \times 2. But (4,2)∉R(4, 2) \notin R, because 22 is not a multiple of 44.

    Therefore RR is not symmetric.

    Transitive? Suppose (x,y)∈R(x, y) \in R and (y,z)∈R(y, z) \in R. Then y=kxy = kx and z=myz = my for some positive integers kk and mm. Substituting,

    z=m(kx)=(mk)xz = m(kx) = (mk)x

    and mkmk is a positive integer, so zz is divisible by xx, i.e. (x,z)∈R(x, z) \in R. For example (1,2)∈R(1, 2) \in R and (2,6)∈R(2, 6) \in R, and indeed (1,6)∈R(1, 6) \in R.

    Therefore RR is transitive.

    Conclusion. RR is reflexive and transitive, but not symmetric.

    Digraph of R = {(x,y) : y is divisible by x} on A = {1,2,3,4,5,6}

    (iv) Z\mathbb{Z}, R={(x,y):x−y is an integer}R = \{(x, y) : x - y \text{ is an integer}\}

    If xx and yy are integers then x−yx - y is automatically an integer. So the condition is satisfied by every pair, and R=Z×ZR = \mathbb{Z} \times \mathbb{Z}.

    Reflexive? x−x=0x - x = 0, which is an integer, so (x,x)∈R(x, x) \in R for every x∈Zx \in \mathbb{Z}. Reflexive.

    Symmetric? If x−yx - y is an integer, then y−x=−(x−y)y - x = -(x - y) is also an integer, so (y,x)∈R(y, x) \in R. Symmetric.

    Transitive? If x−yx - y and y−zy - z are integers, then their sum

    (x−y)+(y−z)=x−z(x - y) + (y - z) = x - z

    is an integer too, so (x,z)∈R(x, z) \in R. Transitive.

    Conclusion. RR is reflexive, symmetric and transitive, so it is an equivalence relation (it is the whole of Z×Z\mathbb{Z} \times \mathbb{Z}).

    (v) AA is the set of human beings in a town at a particular time

    (a) R={(x,y):x and y work at the same place}R = \{(x, y) : x \text{ and } y \text{ work at the same place}\}

    Reflexive: xx works at the same place as xx, so (x,x)∈R(x, x) \in R. Reflexive.

    Symmetric: if xx and yy work at the same place, then yy and xx work at the same place — the phrase is unchanged when the two names are swapped. Symmetric.

    Transitive: if xx works where yy works, and yy works where zz works, then xx and zz work at that same place. Transitive.

    So RR is an equivalence relation; its classes are the workplaces.

    (b) R={(x,y):x and y live in the same locality}R = \{(x, y) : x \text{ and } y \text{ live in the same locality}\}

    This is the same pattern as (a) with "locality" in place of "workplace".

    Reflexive: xx lives in the same locality as xx. Reflexive.

    Symmetric: the condition reads the same both ways round. Symmetric.

    Transitive: same locality as yy, and yy same locality as zz, gives the same locality for xx and zz. Transitive.

    So RR is an equivalence relation; its classes are the localities.

    (c) R={(x,y):x is exactly 7 cm taller than y}R = \{(x, y) : x \text{ is exactly 7 cm taller than } y\}

    Write h(x)h(x) for the height of xx in centimetres. Then (x,y)∈R(x, y) \in R means h(x)=h(y)+7h(x) = h(y) + 7.

    Reflexive: (x,x)∈R(x, x) \in R would need h(x)=h(x)+7h(x) = h(x) + 7, i.e. 0=70 = 7, which is false. Not reflexive.

    Symmetric: if h(x)=h(y)+7h(x) = h(y) + 7, then h(y)=h(x)−7h(y) = h(x) - 7, so yy is 77 cm shorter than xx, not taller. So (y,x)∉R(y, x) \notin R. Not symmetric.

    Transitive: if h(x)=h(y)+7h(x) = h(y) + 7 and h(y)=h(z)+7h(y) = h(z) + 7, then

    h(x)=h(z)+14h(x) = h(z) + 14

    so xx is 1414 cm taller than zz, not 77 cm, and (x,z)∉R(x, z) \notin R. Not transitive.

    Conclusion. Neither reflexive, nor symmetric, nor transitive.

    (d) R={(x,y):x is wife of y}R = \{(x, y) : x \text{ is wife of } y\}

    Reflexive: nobody is her own wife, so (x,x)∉R(x, x) \notin R. Not reflexive.

    Symmetric: if xx is the wife of yy, then yy is the husband of xx, so yy is not the wife of xx and (y,x)∉R(y, x) \notin R. Not symmetric.

    Transitive: here we must be careful, and argue exactly what the definition demands. Transitivity says:

    if (x,y)∈R and (y,z)∈R, then (x,z)∈R.\text{if } (x, y) \in R \text{ and } (y, z) \in R, \text{ then } (x, z) \in R.

    For the "if" part to happen we would need xx to be the wife of yy and yy to be the wife of zz at the same time. But if xx is the wife of yy, then yy is a husband, so yy is nobody's wife; there is no zz with (y,z)∈R(y, z) \in R.

    So the hypothesis of the transitivity statement is never satisfied: there is not one linked pair (x,y),(y,z)(x, y), (y, z) in RR. An implication "if PP then QQ" counts as true whenever PP is never true, because there is no case in which it could fail. This is vacuous truth, the same idea used in part (ii).

    Therefore RR is transitive — vacuously, not because any pair had to be checked.

    Conclusion. RR is transitive, but neither reflexive nor symmetric.

    (e) R={(x,y):x is father of y}R = \{(x, y) : x \text{ is father of } y\}

    Reflexive: nobody is his own father, so (x,x)∉R(x, x) \notin R. Not reflexive.

    Symmetric: if xx is the father of yy, then yy is a child of xx and cannot be the father of xx. Not symmetric.

    Transitive: if xx is the father of yy and yy is the father of zz, then xx is the grandfather of zz, not the father, so (x,z)∉R(x, z) \notin R. Unlike (d), here the hypothesis really can happen (three generations), and the conclusion fails. Not transitive.

    Conclusion. Neither reflexive, nor symmetric, nor transitive.

    The nine verdicts collected together:

    PartRelationReflexiveSymmetricTransitive
    (i)3x−y=03x - y = 0 on {1,…,14}\{1, \dots, 14\}NoNoNo
    (ii)y=x+5y = x + 5, x<4x < 4 on N\mathbb{N}NoNoYes (vacuously)
    (iii)yy divisible by xx on {1,…,6}\{1, \dots, 6\}YesNoYes
    (iv)x−yx - y an integer on Z\mathbb{Z}YesYesYes
    (v)(a)same workplaceYesYesYes
    (v)(b)same localityYesYesYes
    (v)(c)exactly 7 cm tallerNoNoNo
    (v)(d)xx is wife of yyNoNoYes (vacuously)
    (v)(e)xx is father of yyNoNoNo
  2. 2

    Question 2

    Show that the relation RR in the set R\mathbb{R} of real numbers, defined as R={(a,b):a≤b2}R = \{(a, b) : a \leq b^2\} is neither reflexive nor symmetric nor transitive.

    Easy
    3 marks
    Solve with AI
    Written solution

    The relation is R={(a,b):a≤b2}R = \{(a, b) : a \le b^2\} on the set R\mathbb{R} of real numbers.

    To show a property fails, one counterexample is enough. So for each property we hunt for a single bad case.

    Not reflexive

    Reflexivity would mean (a,a)∈R(a, a) \in R for every real aa, that is

    a≤a2for every a∈R.a \le a^2 \quad \text{for every } a \in \mathbb{R}.

    Take a=12a = \tfrac{1}{2}. Then a2=14a^2 = \tfrac{1}{4}, and

    12≤14is false.\tfrac{1}{2} \le \tfrac{1}{4} \quad \text{is false.}

    So (12,12)∉R\left(\tfrac{1}{2}, \tfrac{1}{2}\right) \notin R, and RR is not reflexive.

    It is worth seeing where it goes wrong. a≤a2a \le a^2 rearranges to a2−a≥0a^2 - a \ge 0, i.e. a(a−1)≥0a(a - 1) \ge 0, which holds for a≤0a \le 0 and for a≥1a \ge 1. So reflexivity fails exactly on the open interval 0<a<10 < a < 1.

    Labelled Cartesian axes, horizontal axis labelled a from -1

    Not symmetric

    Symmetry would mean: whenever a≤b2a \le b^2, also b≤a2b \le a^2.

    Take a=1a = 1 and b=2b = 2:

    • (1,2)∈R(1, 2) \in R, because 1≤22=41 \le 2^2 = 4 is true.
    • (2,1)∉R(2, 1) \notin R, because 2≤12=12 \le 1^2 = 1 is false.

    So RR is not symmetric.

    Not transitive

    Transitivity would mean: whenever a≤b2a \le b^2 and b≤c2b \le c^2, also a≤c2a \le c^2.

    Take a=10a = 10, b=4b = 4, c=3c = 3:

    • (10,4)∈R(10, 4) \in R, because 10≤42=1610 \le 4^2 = 16 is true.
    • (4,3)∈R(4, 3) \in R, because 4≤32=94 \le 3^2 = 9 is true.
    • (10,3)∉R(10, 3) \notin R, because 10≤32=910 \le 3^2 = 9 is false.

    Squaring can shrink a number as well as grow it, so the two steps do not chain. Hence RR is not transitive.

    Conclusion. RR is neither reflexive, nor symmetric, nor transitive.

  3. 3

    Question 3

    Check whether the relation RR defined in the set {1,2,3,4,5,6}\{1, 2, 3, 4, 5, 6\} as R={(a,b):b=a+1}R = \{(a, b) : b = a + 1\} is reflexive, symmetric or transitive.

    Easy
    3 marks
    Solve with AI
    Written solution

    Let A={1,2,3,4,5,6}A = \{1, 2, 3, 4, 5, 6\} and R={(a,b):b=a+1}R = \{(a, b) : b = a + 1\}, a relation in AA.

    Write out RR first. For each a∈Aa \in A take b=a+1b = a + 1 and keep the pair only if bb is also in AA:

    • a=1⇒b=2a = 1 \Rightarrow b = 2, so (1,2)∈R(1, 2) \in R
    • a=2⇒b=3a = 2 \Rightarrow b = 3, so (2,3)∈R(2, 3) \in R
    • a=3⇒b=4a = 3 \Rightarrow b = 4, so (3,4)∈R(3, 4) \in R
    • a=4⇒b=5a = 4 \Rightarrow b = 5, so (4,5)∈R(4, 5) \in R
    • a=5⇒b=6a = 5 \Rightarrow b = 6, so (5,6)∈R(5, 6) \in R
    • a=6⇒b=7∉Aa = 6 \Rightarrow b = 7 \notin A, so nothing is added

    Hence

    R={(1,2),(2,3),(3,4),(4,5),(5,6)}R = \{(1, 2), (2, 3), (3, 4), (4, 5), (5, 6)\}

    Reflexive? We would need (a,a)∈R(a, a) \in R for every a∈Aa \in A, i.e. a=a+1a = a + 1, i.e. 0=10 = 1, which is false. Concretely (1,1)∉R(1, 1) \notin R.

    Therefore RR is not reflexive.

    Symmetric? (1,2)∈R(1, 2) \in R, because 2=1+12 = 1 + 1. Is (2,1)∈R(2, 1) \in R? That needs 1=2+1=31 = 2 + 1 = 3, which is false, so (2,1)∉R(2, 1) \notin R.

    Therefore RR is not symmetric.

    Transitive? (1,2)∈R(1, 2) \in R and (2,3)∈R(2, 3) \in R, so transitivity would force (1,3)∈R(1, 3) \in R. But (1,3)(1, 3) needs 3=1+1=23 = 1 + 1 = 2, which is false, so (1,3)∉R(1, 3) \notin R.

    In general, b=a+1b = a + 1 and c=b+1c = b + 1 give c=a+2c = a + 2, which is never a+1a + 1.

    Therefore RR is not transitive.

    Conclusion. RR is neither reflexive, nor symmetric, nor transitive.

    Drawn as arrows, RR is one plain chain: no loops at the nodes, no arrow pointing back, and no shortcut arrow that skips a step.

    Digraph of R = {(1,2),(2,3),(3,4),(4,5),(5,6)} on A = {1,2,3,4,5,6}

  4. 4

    Question 4

    Show that the relation RR in R\mathbb{R} defined as R={(a,b):a≤b}R = \{(a, b) : a \leq b\}, is reflexive and transitive but not symmetric.

    Easy
    3 marks
  5. 5

    Question 5

    Check whether the relation RR in R\mathbb{R} defined by R={(a,b):a≤b3}R = \{(a, b) : a \leq b^3\} is reflexive, symmetric or transitive.

    Easy
    3 marks
  6. 6

    Question 6

    Show that the relation RR in the set {1,2,3}\{1, 2, 3\} given by R={(1,2),(2,1)}R = \{(1, 2), (2, 1)\} is symmetric but neither reflexive nor transitive.

    Easy
    3 marks
  7. 7

    Question 7

    Show that the relation RR in the set AA of all the books in a library of a college, given by R={(x,y):x and y have same number of pages}R = \{(x, y) : x \text{ and } y \text{ have same number of pages}\} is an equivalence relation.

    Easy
    3 marks
  8. 8

    Question 8

    Show that the relation RR in the set A={1,2,3,4,5}A = \{1, 2, 3, 4, 5\} given by R={(a,b):∣a−b∣ is even}R = \{(a, b) : |a - b| \text{ is even}\}, is an equivalence relation. Show that all the elements of {1,3,5}\{1, 3, 5\} are related to each other and all the elements of {2,4}\{2, 4\} are related to each other. But no element of {1,3,5}\{1, 3, 5\} is related to any element of {2,4}\{2, 4\}.

    Easy
    4 marks
  9. 9

    Question 9

    Show that each of the relations RR in the set A={x∈Z:0≤x≤12}A = \{x \in \mathbb{Z} : 0 \le x \le 12\}, given by

    (i) R={(a,b):∣a−b∣ is a multiple of 4}R = \{(a, b) : |a - b| \text{ is a multiple of } 4\}

    (ii) R={(a,b):a=b}R = \{(a, b) : a = b\}

    is an equivalence relation. Find the set of all elements related to 11 in each case.

    Easy
    5 marks
  10. 10

    Question 10

    Give an example of a relation. Which is

    (i) Symmetric but neither reflexive nor transitive.

    (ii) Transitive but neither reflexive nor symmetric.

    (iii) Reflexive and symmetric but not transitive.

    (iv) Reflexive and transitive but not symmetric.

    (v) Symmetric and transitive but not reflexive.

    Easy
    5 marks
  11. 11

    Question 11

    Show that the relation RR in the set AA of points in a plane given by

    R={(P,Q):distance of the point P from the origin is same as the distance of the point Q from the origin}R = \{(P, Q) : \text{distance of the point } P \text{ from the origin is same as the distance of the point } Q \text{ from the origin}\}

    is an equivalence relation. Further, show that the set of all points related to a point P≠(0,0)P \neq (0, 0) is the circle passing through PP with origin as centre.

    Easy
    5 marks
  12. 12

    Question 12

    Show that the relation RR defined in the set AA of all triangles as

    R={(T1,T2):T1 is similar to T2}R = \{(T_1, T_2) : T_1 \text{ is similar to } T_2\}

    is an equivalence relation. Consider three right angle triangles T1T_1 with sides 3,4,53, 4, 5, T2T_2 with sides 5,12,135, 12, 13 and T3T_3 with sides 6,8,106, 8, 10. Which triangles among T1T_1, T2T_2 and T3T_3 are related?

    Easy
    5 marks
  13. 13

    Question 13

    Show that the relation RR defined in the set AA of all polygons as

    R={(P1,P2):P1 and P2 have same number of sides}R = \{(P_1, P_2) : P_1 \text{ and } P_2 \text{ have same number of sides}\}

    is an equivalence relation. What is the set of all elements in AA related to the right angle triangle TT with sides 3,43, 4 and 55?

    Easy
    5 marks
  14. 14

    Question 14

    Let LL be the set of all lines in XYXY plane and RR be the relation in LL defined as

    R={(L1,L2):L1 is parallel to L2}R = \{(L_1, L_2) : L_1 \text{ is parallel to } L_2\}.

    Show that RR is an equivalence relation. Find the set of all lines related to the line y=2x+4y = 2x + 4.

    Easy
    4 marks
  15. 15

    Question 15

    Let RR be the relation in the set {1,2,3,4}\{1, 2, 3, 4\} given by

    R={(1,2),(2,2),(1,1),(4,4),(1,3),(3,3),(3,2)}R = \{(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)\}.

    Choose the correct answer.

    MCQEasy
    1 mark
  16. 16

    Question 16

    Let RR be the relation in the set N\mathbb{N} given by

    R={(a,b):a=b−2, b>6}R = \{(a, b) : a = b - 2,\ b > 6\}.

    Choose the correct answer.

    MCQEasy
    1 mark

Exercise 1.2

Open Exercise 1.2
  1. 17

    Question 17

    Show that the function f:R∗→R∗f : \mathbb{R}^* \to \mathbb{R}^* defined by f(x)=1xf(x) = \dfrac{1}{x} is one-one and onto, where R∗\mathbb{R}^* is the set of all non-zero real numbers. Is the result true, if the domain R∗\mathbb{R}^* is replaced by N\mathbb{N} with co-domain being same as R∗\mathbb{R}^*?

    Easy
    3 marks
  2. 18

    Question 18

    Check the injectivity and surjectivity of the following functions:

    (i) f:N→Nf : \mathbb{N} \to \mathbb{N} given by f(x)=x2f(x) = x^2

    (ii) f:Z→Zf : \mathbb{Z} \to \mathbb{Z} given by f(x)=x2f(x) = x^2

    (iii) f:R→Rf : \mathbb{R} \to \mathbb{R} given by f(x)=x2f(x) = x^2

    (iv) f:N→Nf : \mathbb{N} \to \mathbb{N} given by f(x)=x3f(x) = x^3

    (v) f:Z→Zf : \mathbb{Z} \to \mathbb{Z} given by f(x)=x3f(x) = x^3

    Easy
    5 marks
  3. 19

    Question 19

    Prove that the Greatest Integer Function f:R→Rf : \mathbb{R} \to \mathbb{R}, given by f(x)=[x]f(x) = [x], is neither one-one nor onto, where [x][x] denotes the greatest integer less than or equal to xx.

    Easy
    3 marks
  4. 20

    Question 20

    Show that the Modulus Function f:R→Rf : \mathbb{R} \to \mathbb{R}, given by f(x)=∣x∣f(x) = |x|, is neither one-one nor onto, where ∣x∣|x| is xx, if xx is positive or 00 and ∣x∣|x| is −x-x, if xx is negative.

    Easy
    3 marks
  5. 21

    Question 21

    Show that the Signum Function f:R→Rf : \mathbb{R} \to \mathbb{R}, given by

    f(x)={1,if x>00,if x=0−1,if x<0f(x) = \begin{cases} 1, & \text{if } x > 0 \\ 0, & \text{if } x = 0 \\ -1, & \text{if } x < 0 \end{cases}

    is neither one-one nor onto.

    Easy
    3 marks
  6. 22

    Question 22

    Let A={1,2,3}A = \{1, 2, 3\}, B={4,5,6,7}B = \{4, 5, 6, 7\} and let f={(1,4),(2,5),(3,6)}f = \{(1, 4), (2, 5), (3, 6)\} be a function from AA to BB. Show that ff is one-one.

    Easy
    2 marks
  7. 23

    Question 23

    In each of the following cases, state whether the function is one-one, onto or bijective. Justify your answer.

    (i) f:R→Rf : \mathbb{R} \to \mathbb{R} defined by f(x)=3−4xf(x) = 3 - 4x

    (ii) f:R→Rf : \mathbb{R} \to \mathbb{R} defined by f(x)=1+x2f(x) = 1 + x^2

    Easy
    4 marks
  8. 24

    Question 24

    Let AA and BB be sets. Show that f:A×B→B×Af : A \times B \to B \times A such that f(a,b)=(b,a)f(a, b) = (b, a) is bijective function.

    Easy
    3 marks
  9. 25

    Question 25

    Let f:N→Nf : \mathbb{N} \to \mathbb{N} be defined by

    f(n)={n+12,if n is oddn2,if n is evenfor all n∈Nf(n) = \begin{cases} \dfrac{n+1}{2}, & \text{if } n \text{ is odd} \\ \dfrac{n}{2}, & \text{if } n \text{ is even} \end{cases} \quad \text{for all } n \in \mathbb{N}

    State whether the function ff is bijective. Justify your answer.

    Easy
    3 marks
  10. 26

    Question 26

    Let A=R−{3}A = \mathbb{R} - \{3\} and B=R−{1}B = \mathbb{R} - \{1\}. Consider the function f:A→Bf : A \to B defined by f(x)=x−2x−3f(x) = \dfrac{x - 2}{x - 3}. Is ff one-one and onto? Justify your answer.

    Easy
    3 marks
  11. 27

    Question 27

    Let f:R→Rf : \mathbb{R} \to \mathbb{R} be defined as f(x)=x4f(x) = x^4. Choose the correct answer.

    MCQEasy
    1 mark
  12. 28

    Question 28

    Let f:R→Rf : \mathbb{R} \to \mathbb{R} be defined as f(x)=3xf(x) = 3x. Choose the correct answer.

    MCQEasy
    1 mark
Inside Ch 1

What Class 12 Maths Ch 1 covers

The sections of the chapter, in the order the book takes them. Every question above comes from one of these.

  1. 01Types of Relations
  2. 02Types of Functions
  3. 03Composition Of Functions And Invertible Function
From the board papers

Ch 1 in past CBSE papers

The same chapter as the board has actually asked it. These are worded differently from the textbook exercise, which is the point of reading them.

  1. 1

    Board paper question 1

    If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is

    MCQMediumAsked 2023
    1 mark
    Solve with AI
    Answer
    • (A) 720

    • (B) 120

    • (C) 30

    • (D) 0

      Correct

    Option (D) is correct.

    Explanation: We know that, if A and B are two non-empty finite sets containing m and n elements, respectively, then the number of one-one and onto mapping from A to B is

    • n! if m = n
    • 0 if m ≠ n

    Given that, m = 5 and n = 6

    ∴ m ≠ n

    Number of one-one and onto mapping = 0

    Why the other options are wrong:

    • (A) 720 =6×5×4×3×2= 6 \times 5 \times 4 \times 3 \times 2 is the number of one-one maps from AA to BB. None of them is onto, because the 5 elements of AA can reach only 5 of the 6 elements of BB.
    • (B) 120 =5!= 5! is the number of one-one onto maps between two sets that both have 5 elements. Here BB has 6 elements, so this count does not apply.
    • (C) 30 =5×6= 5 \times 6 is the number of ordered pairs in A×BA \times B, not a number of functions.
  2. 2

    Board paper question 2

    Let A = {3, 5}. Then number of reflexive relations of A is:

    MCQMediumAsked 2022
    1 mark
    Solve with AI
    Answer
    • (A) 2

    • (B) 4

      Correct
    • (C) 0

    • (D) 8

    Option (B) is correct.

    Explanation: A reflexive relation on AA must contain (3,3)(3, 3) and (5,5)(5, 5). The only free choices are the other two pairs of A×AA \times A, namely (3,5)(3, 5) and (5,3)(5, 3). Each can be in or out, so there are 2×2=42 \times 2 = 4 reflexive relations:

    {(3,3),(5,5)}\{(3, 3), (5, 5)\}, {(3,3),(5,5),(3,5)}\{(3, 3), (5, 5), (3, 5)\}, {(3,3),(5,5),(5,3)}\{(3, 3), (5, 5), (5, 3)\} and {(3,3),(5,5),(3,5),(5,3)}\{(3, 3), (5, 5), (3, 5), (5, 3)\}.

    In general, a set with nn elements has n2−n=n(n−1)n^2 - n = n(n-1) such free pairs, so the number of reflexive relations is 2n(n−1)2^{n(n-1)}. Here n=2n = 2:

    ⇒22(2−1)=4\Rightarrow 2^{2(2-1)} = 4

    Why the other options are wrong:

    • (A) 2 treats only one of the two pairs (3,5)(3, 5), (5,3)(5, 3) as free.
    • (C) 0 is false: {(3,3),(5,5)}\{(3, 3), (5, 5)\} is already a reflexive relation on AA.
    • (D) 8 =23= 2^3 treats three pairs as free, but only two are.
  3. 3

    Board paper question 3

    Let RR be a relation in the set N\mathbb{N} given by

    R={(a,b):a=b−2,  b>6}R = \{(a, b) : a = b - 2, \; b > 6\}

    Choose the correct answer.

    MCQEasyAsked 2023
    1 mark
    Solve with AI
    Answer
    • (A) (8,7)∈R(8, 7) \in R

    • (B) (6,8)∈R(6, 8) \in R

      Correct
    • (C) (3,8)∈R(3, 8) \in R

    • (D) (2,4)∈R(2, 4) \in R

    Option (B) is correct.

    Explanation: The set-builder form puts two conditions on a pair. For (a,b)(a,b) to belong to RR we need the equation a=b−2a = b - 2 to hold and the inequality b>6b > 6 to hold. Test each option against both.

    OptionIs a=b−2a = b - 2?Is b>6b > 6?In RR?
    (A) (8,7)(8,7)7−2=57 - 2 = 5, and 5≠85 \ne 8 — fails7>67 > 6 — holdsNo
    (B) (6,8)(6,8)8−2=68 - 2 = 6 — holds8>68 > 6 — holdsYes
    (C) (3,8)(3,8)8−2=68 - 2 = 6, and 6≠36 \ne 3 — fails8>68 > 6 — holdsNo
    (D) (2,4)(2,4)4−2=24 - 2 = 2 — holds4>64 > 6 — failsNo

    Only (6,8)(6,8) passes both tests, so (B) is the answer.

    Option (D) is the trap worth naming. It satisfies the equation a=b−2a = b - 2 exactly, and a student who checks only the equation will choose it. The second condition is what kills it: with b=4b = 4 we do not have b>6b > 6, so the pair is outside RR however well the equation fits.

    Options (A) and (C) fail the other way round. Both have b>6b > 6, so the inequality is fine, but the arithmetic a=b−2a = b - 2 does not come out right — (8,7)(8,7) would need a=5a = 5 and (3,8)(3,8) would need a=6a = 6.

  4. 4

    Board paper question 4

    Let set X={1,2,3}X = \{1, 2, 3\} and a relation RR is defined in XX as:

    R={(1,3),(2,2),(3,2)}R = \{(1, 3), (2, 2), (3, 2)\}, then minimum ordered pairs which should be added in relation RR to make it reflexive and symmetric are:

    MCQMediumAsked 2022
    1 mark
    Solve with AI
    Answer
    • (A) {(1,1),(2,3),(1,2)}\{(1, 1), (2, 3), (1, 2)\}

    • (B) {(3,3),(1,1),(2,3)}\{(3, 3), (1, 1), (2, 3)\}

    • (C) {(1,1),(3,3),(1,2),(2,3)}\{(1, 1), (3, 3), (1, 2), (2, 3)\}

    • (D) {(1,1),(3,3),(3,1),(2,3)}\{(1, 1), (3, 3), (3, 1), (2, 3)\}

      Correct

    Option (D) is correct.

    Explanation: R={(1,3),(2,2),(3,2)}R = \{(1, 3), (2, 2), (3, 2)\} on X={1,2,3}X = \{1, 2, 3\}. For RR to be reflexive, it must contain (1,1),(2,2),(3,3)(1, 1), (2, 2), (3, 3) — (2,2)(2, 2) is already present, so (1,1)(1, 1) and (3,3)(3, 3) must be added.

    For RR to be symmetric, every pair needs its reverse: (1,3)∈R(1, 3) \in R requires (3,1)(3, 1); (3,2)∈R(3, 2) \in R requires (2,3)(2, 3); (2,2)(2, 2) is already self-paired.

    So the minimum pairs to add are (1,1)(1, 1), (3,3)(3, 3), (3,1)(3, 1), and (2,3)(2, 3).

    Why the other options are wrong:

    • (A) {(1,1),(2,3),(1,2)}\{(1, 1), (2, 3), (1, 2)\} leaves out (3,3)(3, 3), so RR is still not reflexive. It also leaves out (3,1)(3, 1), the reverse of (1,3)(1, 3), and adds (1,2)(1, 2) without its reverse (2,1)(2, 1), so RR is not symmetric.
    • (B) {(3,3),(1,1),(2,3)}\{(3, 3), (1, 1), (2, 3)\} makes RR reflexive, but (1,3)(1, 3) is still without its reverse (3,1)(3, 1), so RR is not symmetric.
    • (C) {(1,1),(3,3),(1,2),(2,3)}\{(1, 1), (3, 3), (1, 2), (2, 3)\} also leaves out (3,1)(3, 1), and adds (1,2)(1, 2) without (2,1)(2, 1), so RR is not symmetric.
  5. 5

    Board paper question 5

    If R={(x,y):x,y∈Z,x2+y2≤4}R = \{(x, y) : x, y \in \mathbb{Z}, x^2 + y^2 \leq 4\} is a relation in set Z, then domain of RR is:

    MCQMediumAsked 2019
    1 mark
    Solve with AI
    Answer
    • (A) {0,1,2}\{0, 1, 2\}

    • (B) {−2,−1,0,1,2}\{-2, -1, 0, 1, 2\}

      Correct
    • (C) {0,−1,−2}\{0, -1, -2\}

    • (D) {−1,0,1}\{-1, 0, 1\}

    Option (B) is correct.

    Explanation: Given, R={(x,y):x,y∈Z,x2+y2≤4}R = \{(x, y) : x, y \in \mathbb{Z}, x^2 + y^2 \leq 4\}

    An integer xx is in the domain of RR exactly when some integer yy gives x2+y2≤4x^2 + y^2 \leq 4.

    Since y2≥0y^2 \geq 0, any such xx must satisfy x2≤x2+y2≤4x^2 \leq x^2 + y^2 \leq 4, so x2≤4x^2 \leq 4. Conversely, if x2≤4x^2 \leq 4, then y=0y = 0 works, because x2+02≤4x^2 + 0^2 \leq 4.

    So the domain is {x∈Z:x2≤4}\{x \in \mathbb{Z} : x^2 \leq 4\}, and the integers with x2≤4x^2 \leq 4 are x=0,±1,±2x = 0, \pm 1, \pm 2.

    Thus, domain of RR = {−2,−1,0,1,2}\{-2, -1, 0, 1, 2\}.

    Why the other options are wrong:

    • (A) {0,1,2}\{0, 1, 2\} drops −1-1 and −2-2. They satisfy x2≤4x^2 \leq 4 just as 11 and 22 do; for example (−2,0)∈R(-2, 0) \in R.
    • (C) {0,−1,−2}\{0, -1, -2\} drops 11 and 22 for the same reason; for example (2,0)∈R(2, 0) \in R.
    • (D) {−1,0,1}\{-1, 0, 1\} is the set of integers with 2x2≤42x^2 \leq 4, which comes from wrongly putting y=xy = x. But (2,0)∈R(2, 0) \in R, so 22 is in the domain.
  6. 6

    Board paper question 6

    A relation RR in set A={1,2,3}A = \{1, 2, 3\} is defined as R={(1,1),(1,2),(2,2),(3,3)}R = \{(1, 1), (1, 2), (2, 2), (3, 3)\}. Which of the following ordered pair in RR shall be removed to make it an equivalence relation in AA?

    MCQEasyAsked 2020
    1 mark
    Solve with AI
    Answer
    • (A) (1,1)(1, 1)

    • (B) (1,2)(1, 2)

      Correct
    • (C) (2,2)(2, 2)

    • (D) (3,3)(3, 3)

    Option (B) is correct.

    Explanation:

    We are given R={(1,1),(1,2),(2,2),(3,3)}R=\{(1,1),(1,2),(2,2),(3,3)\} on A={1,2,3}A=\{1,2,3\}. Test the three properties on RR as it stands.

    Reflexive? Yes. The loops (1,1)(1,1), (2,2)(2,2) and (3,3)(3,3) are all present, so every element of AA is related to itself.

    Symmetric? No. (1,2)∈R(1,2)\in R but (2,1)∉R(2,1)\notin R. This is the only ordered pair that breaks the property.

    Transitive? Yes. Apart from the loops, the only chain we can form through a common middle element is (1,2)(1,2) followed by (2,2)(2,2), and it requires (1,2)∈R(1,2)\in R — which is already there. Nothing is missing, so RR is transitive as given.

    So RR fails exactly one property, symmetry, and the single pair responsible is (1,2)(1,2). Deleting it leaves {(1,1),(2,2),(3,3)}\{(1,1),(2,2),(3,3)\}, the identity relation on AA, which is reflexive, symmetric and transitive — an equivalence relation.

    Here is what each choice would leave behind:

    Pair removedWhat is leftVerdict
    (A) (1,1)(1,1){(1,2),(2,2),(3,3)}\{(1,2),(2,2),(3,3)\}(1,1)(1,1) is gone, so not reflexive
    (B) (1,2)(1,2){(1,1),(2,2),(3,3)}\{(1,1),(2,2),(3,3)\}reflexive, symmetric and transitive
    (C) (2,2)(2,2){(1,1),(1,2),(3,3)}\{(1,1),(1,2),(3,3)\}not reflexive, and still not symmetric
    (D) (3,3)(3,3){(1,1),(1,2),(2,2)}\{(1,1),(1,2),(2,2)\}not reflexive, and still not symmetric

    Options (A), (C) and (D) each delete a loop, which destroys reflexivity, and none of them repairs the missing (2,1)(2,1). Only (B) works.

All 37 board paper questions for this chapter, solved the same way.

Common questions

Class 12 Maths Ch 1 questions students ask

How many questions are there in Class 12 Maths Ch 1?

28 questions, across 2 exercises (Exercise 1.1, Exercise 1.2). Every one is solved step by step on this page.

Are these Class 12 Maths solutions free?

Yes. Every question and its full working is free to read, with no account needed.

Can I download the Class 12 Maths Ch 1 solutions as a PDF?

There is no PDF to download. Every solution is on this page instead, which means it is searchable, always the current syllabus, and readable on a phone. Use your browser's print option if you want it on paper.