- #1
nowimpsbball
- 15
- 0
Let A be a set of n distinct elements. There is a one to one correspondence between binary relations on the set A and subsets R<= A x A
a. Computer the number of binary realtions on A
b. A binary relation R is said to be symmetric if for every (a,b) in R, (b,a) is also in R. Compute the number of symmetric binary relations on A.
c. A binary relation R is said to be antisymmetric if for every (a,b) in R (a doesn't equal b), (b,a) is not in R. Compute the number of antisymmetric binary relations on A
Really no equations to my knowledge, a Discrete Math course.
I am really having a hard time getting off the ground on this one, and I don't know why...I am thinking/hoping this problem is easier than I am making it out to be...I tend to over think a lot
Thanks, any hints/suggestions/solutions would be greatly appreciated.
a. Computer the number of binary realtions on A
b. A binary relation R is said to be symmetric if for every (a,b) in R, (b,a) is also in R. Compute the number of symmetric binary relations on A.
c. A binary relation R is said to be antisymmetric if for every (a,b) in R (a doesn't equal b), (b,a) is not in R. Compute the number of antisymmetric binary relations on A
Really no equations to my knowledge, a Discrete Math course.
I am really having a hard time getting off the ground on this one, and I don't know why...I am thinking/hoping this problem is easier than I am making it out to be...I tend to over think a lot
Thanks, any hints/suggestions/solutions would be greatly appreciated.