| 搜索三个不同坏硬币的测试次数 |
| |
| 引用本文： | 张瑞,李秀森,李功胜,潘月君.搜索三个不同坏硬币的测试次数[J].数值计算与计算机应用,2003,24(2):129-132. |
| |
| 作者姓名： | 张瑞 李秀森 李功胜 潘月君 |
| |
| 作者单位： | 山东理工大学数学与信息学院,淄博,255049 |
| |
| 摘 要： | §1.简介 设S={c_1,c_2,…,c_n}是由n个外观相同的硬币组成的集合,其中恰有m个稍重的坏硬币,试用最少的测试次数找出这m个坏硬币.以μ_m(n)表示最少测试次数,由信息论可知
|
| 修稿时间： | 2000年11月16 |
TESTING TIMES OF DETECTING THREE DIFFERENT COUNTERFEIT COINS |
| |
| Zhang Rui Li Xiusen Li Gongsheng Pan Yuejun.TESTING TIMES OF DETECTING THREE DIFFERENT COUNTERFEIT COINS[J].Journal on Numerical Methods and Computer Applications,2003,24(2):129-132. |
| |
| Authors: | Zhang Rui Li Xiusen Li Gongsheng Pan Yuejun |
| |
| Abstract: | We consider the problem of ascertaining the minimum unmber of weighings which suffice to determine three counterfeit coins in a set of n coins given a balance scale, where three counterfeit coins are heavier than good ones and are of different weight. Denote by g3(n) the least unmber of weighings to find three irregulars among n coins. In this paper we construct an algorithm and proved that |
| |
| Keywords: | Counterfeit coin problem Test Information-theoretic bound Optimal procedure robustness |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
