用一台天平从n=10，11个元素的集合中称量出两个坏硬币的最优化过程

An Optimal Approach to Find Two Counterfeit Coins by a Balance Scale in an n=10,11 Set

给出了用一台天平搜索两个坏硬币的最优化过程,并且这两个坏硬币的重量是相等的.一台天平所提供的坏硬币的信息,是通过比较两个由硬币组成集合的重量而获得的.

This paper gives an optimal approach by a balance scale sufficient to find, among n coins, two counterfeit coins which are know to be heavier than the normal ones. The balance scale provides information about the irregulars by comparing the weights of two subsets of coins.