Let R be an equivalence relation defined...

Let R be an equivalence relation defined on a set containing 6 elements. The minimum number of ordered pairs that R should contain is

A

`m ge n`

B

` m le n`

C

m = n

D

`m lt n`

Verified by Experts

The correct Answer is:

A

Similar Questions

Explore conceptually related problems

Let R be an equivalence relation defined on a set containing 6 elements. The minimum number of orderded pairs that R should contain is :

Let R be an equaivalence relation defined on a set containg 6 elements .The minimum number of ordered pairs that R should contain is :

A set contains n elements. The Power set contains

Let R_1 and R_2 be two equivalence relations in the set A. Then:

The number of elements of the power set of a set containing n elements is

The number of equivalence relation that can be defined on (a, b, c) is

Let A = {1,2,3}. Then number of equivalence relations containing (1,2) is

Let A be a set containing 10 distinct elements . Then the total number of distinct functions from A to A is :

Show that number of equivalence relation in the set {1,2,2} containing (1,2) and (2,1) is two.

Let R be a relation on a set A such that R= R^(-1) . Then R is :