Given a balance scale that is sure to break after X weighings, find an equation for the largest number of coins N, from which you can determine a fake coin that has the wrong weight if

A: You know whether the fake is lighter or heavier

B: You do not know whether the fake is lighter or heavier

(Assume only one of the N coins is fake)

(In reply to solution to B by pleasance)

I'd be interested in seeing what the strategy is for any of these. I ask in light of Sanjay's comment to this and also to the 39 Coins problem, where he shows that not all information-theoretic possibilities are really possible. So I think there might be a flaw in what strategies you have found that allow more than n = (3^x-3)/2.

Posted by Charlie on 2003-05-18 04:48:18