AVERAGE NUMBER OF WEIGHINGS TO LOCATE A COUNTERFEIT COIN

被引：7

作者：

MEAD, DG

机构：

[1] Department of Mathematics, University of California, Davis, CA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1979年 / 25卷 / 05期

关键词：

D O I：

10.1109/TIT.1979.1056091

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A solution is obtained to the problem of finding the minimum of the average number of weighings, using a balance, needed to locate one light coin from among n coins of which n – 1 are genuine and of the same weight. Optimal strategies are determined, and the anomaly that it may be better to work with n + 1 coins rather than n is examined and explained. © 1979 IEEE

引用

页码：616 / 617

页数：2