On Various Versions of the Defective Coin Problem.
Expert InsightsPublished 1961
An analysis of the problem of ascertaining the minimum number of weighings which suffice to determine the defective coin in a set of N Coins of the same appearance, given an equal arm balance and the information that there are two or more defective coins present. An attempt is made to indicate a systematic way in which the theory of dynamic programming can be used to provide a computational solution to determine optimal and suboptimal testing policies. This is illustrated by means of some numerical results obtained using a digital computer.
Document Details
- Copyright: RAND Corporation
- Availability: Web Only
- Year: 1961
- Pages: 22
- DOI: https://doi.org/10.7249/pubs
- Document Number: P-2145
Citation
RAND Style Manual
Chicago Manual of Style
This publication is part of the RAND paper series. The paper series was a product of RAND from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.