In this paper, by virtue of the combinatorial optimization and group testing method and, with a scale without weight, we detect n coins containing at most one abnormal.The n coins are indistinguishable only by their a...In this paper, by virtue of the combinatorial optimization and group testing method and, with a scale without weight, we detect n coins containing at most one abnormal.The n coins are indistinguishable only by their appearances. We derive an optimal procedure of determining whether all the n balls are normal or not and in the latter case, our procedure (algorithm) also tells whether the abnormal weighs more or weighs less than each of the normals. The optimal algorithm obtained in this paper is constructive.展开更多
文摘In this paper, by virtue of the combinatorial optimization and group testing method and, with a scale without weight, we detect n coins containing at most one abnormal.The n coins are indistinguishable only by their appearances. We derive an optimal procedure of determining whether all the n balls are normal or not and in the latter case, our procedure (algorithm) also tells whether the abnormal weighs more or weighs less than each of the normals. The optimal algorithm obtained in this paper is constructive.
