[Solved] 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?

McqMate

Q.	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.	2n(n+1)/2 and 2n.3n(n–1)/2
B.	3n(n–1)/2 and 2n(n–1)
C.	2n(n+1)/2 and 3n(n–1)/2
D.	2n(n+1)/2 and 2n(n–1)/2
Answer» D. 2n(n+1)/2 and 2n(n–1)/2

1.1k

0

Do you find this helpful?

11

View all MCQs in

Discrete Structure (DS)

Discussion

No comments yet

Related MCQs

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
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.
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.
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---
A partial ordered relation is transitive, reflexive and
Let S be a set of n elements. The number of ordered pairs in the largest and the smallest equivalence relations on S are:
The number of distinct relations on a set of 3 elements is