Let \( A = \{1, 2, 3\} \). Find the number of equivalence relations containing \( (1, 2) \).

As shown in Example 24, the equivalence relations containing \( (1, 2) \) are the smallest equivalence relation generated by \( \{(1,2), (2,1)\} \) and the universal relation, totaling 2.