An improved lower bound on the counterfeit coins problem
Combinatorics
2010-04-27 v3
Abstract
In this paper, we will give an improvement on the lower bound for the counterfeit coins problem in the case that the number of false coins is unknown in advance
Cite
@article{arxiv.0906.0693,
title = {An improved lower bound on the counterfeit coins problem},
author = {An-Ping Li and Hagen von Eitzen},
journal= {arXiv preprint arXiv:0906.0693},
year = {2010}
}
Comments
there is a new lower bound presented.