Q8 of 109 Page 1

Let A = {1, 2, 3}. Then, the number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is

R={(1,2),(2,1),(1,3),(3,1),(1,1)} is the only relation.

The addition of (2,2) or (3,3) will make R transitive.

More from this chapter

All 109 →
6

If A = {a, b, c}, then the relation R = {(b, c)} on A is

 7

Let A = {2, 3, 4, 5, …, 17, 18}. Let ‘≃’ be the equivalence relation on A × A, cartesian product of A with itself, defined by (a, b) ≃ (c, d) iff ad = bc. Then, the number of ordered pairs of the equivalence class of (3, 2) is

 9

The relation ‘R’ in N × N such that (a, b) R (c, d) ⬄ a + d = b + c is

 10

If A = {1, 2, 3}, B = {1, 4, 5, 9} and R is a relation from A to B defined by ‘x is greater than y’. Then, Range of R is