Given: A = {1, 2, 3}
The largest equivalence relation contains all the possible ordered pairs.
Therefore, R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3), (3, 2), (1, 3), (3, 1)} is the largest equivalence relation.
Hence, the largest equivalence relation on the set A = {1, 2, 3} is {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3), (3, 2), (1, 3), (3, 1)}.