MathDB

We have

n{}

coins, one of which is fake, which differs in weight from the real ones and a two-pan scale which works correctly if the weights on the pans are different, but can show any outcome if the weights on the pans are equal. For what

n{}

can we determine which coin is fake and whether it is lighter or heavier than the real coins, in at most

k{}

weightings?
Proposed by A. Zaslavsky

Problem Statement