There are 2¹⁰ = 1,024 subsets of the 10 integers, but there can be only 901 (= 955 - 55 + 1) possible sums, the number of integers between the minimum and maximum sums of ten distinct integers between 1 and 100. With more subsets than possible sums, there must exist at least one sum that corresponds to at least two subsets. Call two subsets with equal sums S' and T'.

Let C = S' ∩ T'; define S = S' - C, T = T' - C. Then S and T are disjoint, and