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

Related MCQs

• 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 that is reflexive, anti-symmetric and transitive is a
• Let R = {(a, a), (a, b)} be a relation on S = {a, b, c}. Then R is not reflexive and not symmetric.
• Let N+ denote the nonzero natural numbers. Define a binary relation R on N+ × N+ by (m, n)R(s, t) if gcd(m, n) = gcd(s, t). The binary relation R is
• 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.
• Define a binary relation R = {(0, 1), (1, 2), (2, 3), (3, 2), (2, 0)} on A = {0, 1, 2, 3}. The directed graph (including loops) of the transitive closure of this relation has
• 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---
• If a has relation with b and b has relation with c then a has relation with c is………………..Relation.