2010 OIM Problems/Problem 1

Revision as of 15:04, 14 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == There are ten indistinguishable coins placed in a line. It is known that two of them are false and occupy consecutive positions on the line. For each set of posi...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

There are ten indistinguishable coins placed in a line. It is known that two of them are false and occupy consecutive positions on the line. For each set of positions, you can ask how many fake coins it contains. Is it possible to determine which coins are fake asking only two of these questions, without knowing the answer to the first one before formulating the second?

~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