How to detect a counterfeit coin: Adaptive versus non-adaptive solutions

Axel Born, Cor A.J. Hurkens, Gerhard Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)

Abstract

In an old weighing puzzle, there are n3 coins that are identical in appearance. All the coins except one have the same weight, and that counterfeit one is a little bit lighter or heavier than the others, though it is not known in which direction. What is the smallest number of weighings needed to identify the counterfeit coin and to determine its type, using balance scales without measuring weights? This question was fully answered in 1946 by Dyson [The Mathematical Gazette 30 (1946) 231–234]. For values of n that are divisible by three, Dyson's scheme is non-adaptive and hence its later weighings do not depend on the outcomes of its earlier weighings. For values of n that are not divisible by three, however, Dyson's scheme is adaptive. In this note, we show that for all values n3 there exists an optimal weighing scheme that is non-adaptive.
Original languageEnglish
Pages (from-to)137-141
Number of pages5
JournalInformation processing letters
Volume86
Issue number3
DOIs
Publication statusPublished - 2003

Keywords

  • Algorithms
  • METIS-213205
  • IR-75027
  • Mathematical puzzle
  • Weighing problem
  • Non-adaptive algorithm

Fingerprint Dive into the research topics of 'How to detect a counterfeit coin: Adaptive versus non-adaptive solutions'. Together they form a unique fingerprint.

Cite this