The coffee machine

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?


The answer is 2922.

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.

1 solution

If we label as x 1 x_1 through x 10 x_{10} , 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 n between 1 1 and 10 10 and at least n n professors willing to spend 1000 n \frac{1000}{n} dollars. The worst possible situation, then, corresponding with the highest sum of the x i 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

999 + 499 + 333 + 249 + 199 + 166 + 142 + 124 + 111 + 99 = 2921 999+499+333+249+199+166+142+124+111+99=2921

and a situation in which the purchase is not guaranteed. Clearly, any sum higher than 2921 2921 ensures that for some index n n , x n x_n is greater than 1000 n \frac{1000}{n} and thus, because of the decreasing order,

x 1 + + x n n x n 1000 x_1+\ldots +x_n \geq nx_n\geq 1000 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...