2014 OIM Problems/Problem 4

Revision as of 14:11, 14 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == There are <math>N</math> coins, of which <math>N-1</math> are authentic of equal weight and one is false, of different weight than the others. The objective is,...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

There are $N$ coins, of which $N-1$ are authentic of equal weight and one is false, of different weight than the others. The objective is, using exclusively a two-dimensional scale with dishes, find the fake coin and determine if it is heavier or lighter than the authentic ones. Whenever it can be deduced that one or more coins are authentic, then all those coins are separated immediately and cannot be used in subsequent weightings. Find all $N$ for which the objective can be achieved with certainty. (You can do so many weightings as desired.)

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions