Let = { 1,2,3,4 }
a) Write a relation on A which is symmetric only
b) Write the smallest transitive relation on A containing (3,4)
c) How many equivalence relations can you define on A containing
exactly five elements
Answers
Answered by
0
Step-by-step explanation:
Just one way. This is the identity equivalence relationship. Thus, there are, in total 1+4+3+6+1=15 partitions on {1,2,3,4}, and thus 15 equivalence relations.
Answered by
0
What are lesson name Which subjects are
Similar questions