Confirming your payment

Skip to content

Opening your dashboard

Class 12 Maths Ch 1 Ex 1.1: Relation and Functions Solutions

16 questions from Exercise 1.1 of Class 12 Maths Chapter 1, Relation and Functions, each solved step by step. Free to read, CBSE 2026-27.

Ex 1.1 solutions

16 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.

  1. 1

    Exercise 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

    Exercise 1.1 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

    Exercise 1.1 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

    Exercise 1.1 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

    Exercise 1.1 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

    Exercise 1.1 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

    Exercise 1.1 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

    Exercise 1.1 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

    Exercise 1.1 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

    Exercise 1.1 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

    Exercise 1.1 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

    Exercise 1.1 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

    Exercise 1.1 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

    Exercise 1.1 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

    Exercise 1.1 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

    Exercise 1.1 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
AI Tutor

Stuck on one of these? Work it through out loud

A finished solution tells you the answer. The AI tutor takes one question of Ex 1.1 at a time and works it with you until you can do the next one on your own.

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

The other exercise in Relation and Functions

Every exercise in Class 12 Maths Ch 1, solved the same way. Or open the whole chapter on one page.

Common questions

What students ask about Ex 1.1

How many questions are in Ex 1.1 of Class 12 Maths?

Ex 1.1 has 16 questions, 2 of them multiple choice. Every one is solved step by step on this page, free to read.

Where does Ex 1.1 come in Chapter 1?

It is the first of the 2 exercises in Class 12 Maths Chapter 1, Relation and Functions. Exercise 1.2 comes after it.

How many marks is Ex 1.1 worth?

The 16 questions here carry 62 marks between them, at easy difficulty overall. Marks are shown on each question so you can see what a full answer needs.

Are these Ex 1.1 solutions free?

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

Can I download Ex 1.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 2026-27 syllabus, and readable on a phone. Use your browser's print option if you want it on paper.