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 bal-ance scale, where three counterfeit coins are heavier than goo...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 bal-ance 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 ir-regulars among n coins. In this paper we construct an algorithm and proved that |log3(n3)|≤g3(n)≤|log3(n3)|+2.展开更多
文摘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 bal-ance 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 ir-regulars among n coins. In this paper we construct an algorithm and proved that |log3(n3)|≤g3(n)≤|log3(n3)|+2.