Suppose you have an object made up of two w-bit integers, x and y. Suppose that the hash code for your object is defined by some deterministic function h(x; y) that produces a single w-bit integer. Prove that there exists a large set of objects that have the same hash code