If a [i] is equal for m pieces different i, how do we get the number of equal pairs it gives rise to? (If m <2 there will be no pairs at all, if m = 2 there will be one p
