Weighing the coins!
Source: Problem 3 - Brazil Math Olympiad 1994
March 17, 2006
floor functionalgorithmcombinatorics proposedcombinatorics
Problem Statement
We are given n objects of identical appearance, but different mass, and a balance which can be used to compare any two objects (but only one object can be placed in each pan at a time). How many times must we use the balance to find the heaviest object and the lightest object?