If A is a set with 3 elements, how many equivalence relations are there on A? Hint: The set of equivalence classes for a given equivalence relation on A is a partition of the set A.

Related MCQs

• The union of two equivalence relations on a non- empty set is an equivalence relation.
• Define an equivalence relation R on the positive integers A = {2, 3, 4, . . . , 20} by m R n if the largest prime divisor of m is the same as the largest prime divisor of n. The number of equivalence classes of R is
• How many relations are there on a set with n elements that are symmetric and a set with n elements that are reflexive and symmetric?
• A relation R is defined on Z by xRy if 2x +5y = 0(mod7). Then the equivalence class[10] is equal to the equivalence class…
• Let S be a set of n elements. The number of ordered pairs in the largest and the smallest equivalence relations on S are:
• If a has relation with b and b has relation with c then a has relation with c is………………..Relation.
• Define a binary relation R on a set A to be anti- reflexive if xRx doesn’t hold for any x 2 A. The number of symmetric, anti-reflexive binary relations on a set of ten elements is
• Set A has 3 elements, set B has 6 elements, then the minimum number of elements in A U B is ….
• Set A has 3 elements, set B has 6 elements, then the minimum number of elements in A U B is ….
• If set A contains n elements, set B contains m elements then number of elements in AXB is---