Complementary counting computes the probability of an event through its complement, , when the complement is a single simple case and the event itself is a union of many overlapping ones: “at least one”, “some two coincide”, “not all different”.
Exemples
Example 10.2 (Colliding identifiers)
Thirty client order identifiers are drawn uniformly and independently from 10 000 values. The chance that all differ is , so at least two coincide with probability about 0.043. The approximation gives the same to three decimals, and it shows the scale: collisions become likely once is of the order of .