Consider the set of positive integers 0, 1, 2, ..., D. If we pick N of them at random, where N < (D+1), what is the expectation (or average value) of the lowest-valued of the N picks? We briefly describe the image database search question that gave rise to this problem, and present a proof that the answer is (D-N+1)/(N+1).
