Consider a set of m distinct positive integers. What’s the largest integer, d,
that when divided into the m integers is guaranteed to produce at least one
pair of results with the same remainder? Explain.