首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Searching for a counterfeit coin with two unreliable weighings
Authors:Wen-An Liu  Qi-Min Zhang  Zan-Kan Nie
Institution:

aFaculty of Mathematics and Information Science, Henan Normal University, Xinxiang 453002, PR China

bFaculty of Mathematics and Computer Science, Ningxia University, Yinchuan 750021, PR China

cFaculty of Science, Xi’an Jiaotong University, Xi’an 710049, PR China

Abstract:We provide a worst-case optimal procedure to identify one unknown heavy coin among N identically looking coins when a balance scale is used and at most two weighing results can be erroneous. The exact minimal number of weighings is determined. This solves completely the weighing problem of the case of two unreliable weighings.
Keywords:Adaptive searching with unreliable information  Weighing problem  Worst-case optimal procedure  Information-theoretic bounds
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号