Skip to main content
Log in

Searching for counterfeit coins

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

The well-known counterfeit problem asks for the minimum number of weighings necessary to determine all fake coins in a given set ofn coins. We derive a new upper bound when we know that at mostd coins are defective, improving a previous result of L. Pyber.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aigner, M.: Combinatorial Search. Wiley-Teubner 1988

  2. Bellman, R., Glass, B.: On various versions of the defective coin problem. Inform. Control4, 141–147 (1961)

    Google Scholar 

  3. Hu, X.D., Chen, P.D., Hwang, F.K.: A new competitive algorithm for the counterfeit coin problem. Inform. Proc. Letters51, 213–218 (1994)

    Google Scholar 

  4. Li, A.P.: On the conjecture at two counterfeit coins. Discrete Math. (to be published)

  5. Li, A.P.: Three counterfeit coins problem. J. Comb. Theory Ser. A (to be published)

  6. Li, A.P., Lin, V.P.: Four counterfeit coins problem. Bull. Sci. China (to be published)

  7. Li, A.P.: Some results on weighing problems. Manuscript

  8. Pyber, L.: How to find many counterfeit coins?. Graph. Comb.2, 173–177 (1986)

    Google Scholar 

  9. Tošić, R.: Two counterfeit coins. Discrete Math.46, 295–298 (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aigner, M., Li, A. Searching for counterfeit coins. Graphs and Combinatorics 13, 9–20 (1997). https://doi.org/10.1007/BF01202233

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01202233

Keywords

Navigation