Four counterfeit coins problem

1995中国科学通报：英文版Mathematics被引 1

摘要

Let S be the set of n coins,in which there are m counterfeit coins, heavier (or lighter) than the normals. How many weighings do we need to find the m fakes by a balance? Denote by g_m(n) the least number of weighings we need.

引用本文（GB/T 7714）

李安平, 刘彦佩. Four counterfeit coins problem[J]. 中国科学通报：英文版, 1995.

引文网络

参考文献与被引分析加载中…

本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。