|
|
#1
10-12-2007, 01:11 AM
|
|||
|
|||
math problem
A tow-pan balance and 16 coins of different weights are given. What is the fewest number of usages of the balance needed to determine the heaviest coin, the second heaviest coin and the third heaviest coin?
How many can you do it in? I can't think of anything better then a pretty brute technique that does it in 23. 
|
|
|
Threaded Mode