Let A be a set of n (≥ 3) distinct elements. The number of triplets (x, y, z) of the A elements in which at least two coordinates is equal to

Total number of triplets without restriction is n×n×n.The number of triplets with all different coordinates is nP3.Therefore, the required number of triplets is n3−n(n−1)(n−2).