Occupancy Problem Theorem: m balls into n bins: If m-n,the max load is ( with high probability.Theorem: If m = n, the max load is O ￾ ln n ln ln n ⇥ with high probability. Occupancy Problem m balls into n bins: