Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
The number of non-empty equivalence relations on the set $\{1,2,3\}$ is :
Step 1: Every equivalence relation corresponds uniquely to a partition into equivalence classes.
Step 2: The five partitions of {1,2,3} are the all-singleton partition, the three partitions with one pair and one singleton, and the one-block partition.
Step 3: There are 5 equivalence relations, all nonempty because they contain the diagonal. The answer is option C.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.