How many symmetric

Create a free Team What is Teams? Learn more. Ask Question. Asked 10 years, 10 months ago. Active 30 days ago. Viewed 47k times. Thank you. Anonymous Anonymous 3 3 gold badges 5 5 silver badges 6 6 bronze badges. Since I don't just want to give the answer, here's a good hint: how many total relations are there for an n-element set, and what do they correspond to?

Now, what do the symmetric relations correspond to, and can you use that to find your answer? In the past people have been flamed for asking what Steven is asking above.

Do we have a new policy on, now that the elections are over? From here, I don't see how to find the number of all the symmetric relations - I just know that it has to be symmetric from the diagonal or on the diagonal. Please log in or register to answer this question. That's a precise explanation. Why reflexive is 2 power n 2 -n.

Please explain the reason behind this solution. Leen yes :. Anjali yes, correct.. Reflexive relation:: A relation is called as refleive if and only if aRa or bRb where a and b both belong to relation R. Paras Nath answered Sep 19, Next Qn. Related questions 0 votes. Which of the following statement is true with respect to R? Determine whether the relation is reflexive, symmetric, antisymmetric or transitive?

What are Symmetric Relations? Asymmetric, Anti-symmetric and Symmetric Relations 3. Number of Symmetric Relations 4. Asymmetric, Anti-symmetric and Symmetric Relations. Hence, R is not a symmetric relation. Solution: To make R a symmetric relation, we will check for each element in R. Answer: b, a and c, b should belong to R to make R a symmetric relation. Great learning in high school using simple cues.

Indulging in rote learning, you are likely to forget concepts. Article Contributed By :. Easy Normal Medium Hard Expert.

Writing code in comment? Please use ide. Load Comments. What's New. Most popular in Combinatorial. Count ways to reach the nth stair using step 1, 2 or 3 Combinational Sum Print all possible strings of length k that can be formed from a set of n characters Count of subsets with sum equal to X Lexicographic rank of a string.