Home
Class 12
MATHS
Let A={a , b , c) and the relation R be ...

Let `A={a , b , c)` and the relation R be defined on A as follows: `R={(a , a),(b , c),(a , b)}dot` Then, write minimum number of ordered pairs to be added in R to make it reflexive and transitive.

Text Solution

Verified by Experts

The correct Answer is:
N/a

Given relation, `R={(a,a),(b,c),(a,b)}`
To make R is reflexive we must add (b, b) and (c, c) to R. Also, to make R is transitive we must add (a,c) to R.
So, mimimum number of ordered pair is to be added are (b, b), (c, c), (a, c).
Doubtnut Promotions Banner Mobile Dark
|

Topper's Solved these Questions

  • PROBABILITY

    NCERT EXEMPLAR|Exercise Probability|107 Videos
  • THREE DIMENSIONAL GEOMETRY

    NCERT EXEMPLAR|Exercise Three Dimensional Geometry|46 Videos

Similar Questions

Explore conceptually related problems

Let A={a,b,c) and the relation R be defined on A as follows: R={(a,a),(b,c),(a,b)} Then,write minimum number of ordered pairs to be added in R to make it reflexive and transitive.

Let set A={3,6,9,12} . Then find number of ordered pairs which when added to R make it reflexive and transitive relation

Knowledge Check

  • Let A = {a, b, c} andR = {(a, b), (b, c)}. The minimum number of ordered pairs that must be added to R to make it an equivalence relation is

    A
    5
    B
    6
    C
    7
    D
    8
  • Let R = {(1, 2), (2, 3)} be a relation defined on set {1, 2, 3}. The minimum number of ordered pairs required to be added in R, such that enlarged relation becomes an equivalence relation is

    A
    3
    B
    5
    C
    7
    D
    9
  • Similar Questions

    Explore conceptually related problems

    Let set A={1,2,3} . Then find number of ordered pairs which when added to R make it reflexive but not symmetric

    Let R={(a,a),(b,c),(a,b)} be a relation on a set A={a,b,c} . Then the minimum number of ordered pairs which when added to R make it an equivalence realtion are ...

    Let A={1,2,3} and R={(1,2),(1,1),(2,3)} be a relation on A. What minimum number of ordered pairs may be added to R so that it may become a transitive relation on A.

    For the set A={1,\ 2,\ 3} , define a relation R on the set A as follows: R={(1,\ 1),\ (2,\ 2),\ (3,\ 3),\ (1,\ 3)} Write the ordered pairs to be added to R to make the smallest equivalence relation.

    Let set A=(a, b, c, d) and R= {(a, b), (b, c). (c, d)} is a relation on set A. The minimum number of ordered pairs which should be added into R to make it an equivalence relation on set A is

    Let A={1,2,3} and R={(1,2),(1,1),(2,3)} be a relation on on A. What minimum number of ordered pairs may be added to R so that it may become a transitive relation on A.