A University department, with ten professors, is considering buying a coffee machine to put in the professors' room. The machine costs 1000$. The professors are asked, in a private email, how much they are willing to spend, at most, to participate in the purchase and gain the right to use the machine. Each one answers with an amount. What is the minimal sum, in dollars, of these amounts that ensures the formation of a group of participants, of any size, among the professors, able to buy the machine, every participant paying the same amount and spending no more than what they wanted to?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
If we label as x 1 through x 1 0 , in decreasing order, the amounts the professors are willing to spend, it is clear that the purchase will take place if there is an integer n between 1 and 1 0 and at least n professors willing to spend n 1 0 0 0 dollars. The worst possible situation, then, corresponding with the highest sum of the x i that does not allow the purchase, happens when the "most willing" professor is willing to spend 999, the second one 499, etc. giving a sum
9 9 9 + 4 9 9 + 3 3 3 + 2 4 9 + 1 9 9 + 1 6 6 + 1 4 2 + 1 2 4 + 1 1 1 + 9 9 = 2 9 2 1
and a situation in which the purchase is not guaranteed. Clearly, any sum higher than 2 9 2 1 ensures that for some index n , x n is greater than n 1 0 0 0 and thus, because of the decreasing order,
x 1 + … + x n ≥ n x n ≥ 1 0 0 0 .