How many equivalence relations can be defined on the set such that the partition has exactly two equivalence classes, one of size 2 and the other of size 2?
Answer
3
The correct answer is 3 — Each partition corresponds to exactly one equivalence relation.
Step-by-step solution
- A partition with two blocks of size 2 is determined by choosing which two elements form the first block.
- Number of ways to choose 2 elements out of 4: C(4,2)=6.
- But swapping the two blocks does not give a new partition, so divide by 2.
- Thus number of such partitions = 6/2 = 3.
- Each partition corresponds to exactly one equivalence relation.
Common mistake: Counting each choice of blocks as distinct, leading to 6 instead of 3
Concept tested: Counting equivalence relations via partitions
Published · How this solution was prepared and checked
← All Relations and Functions questions