Question

2) Let A={1,3,5} .then the number of equivalence relation in A containing
(1,3) is​

Answer 1

Answer:

Step-by-step explanation:

A={1,2,3}

For equivalence relation containing (1,2)

For symmetric, it must consists (1,2) and (2,1).

For transitivity, it must consists (1,3) and (3,2) and (1,2),(2,1),(2,3),(3,1)

For reflexivity, it must consists (1,1) and (2,2),(3,3)

⇒R={(1,1),(2,2),(2,3),(3,3),(1,2)(1,3),(2,1),(3,1),(3,1)}

⇒ Only 1 such relation is possible.