✦ LIBER ✦

Searching for counterfeit coins

✍ Scribed by Martin Aigner; Anping Li

Publisher: Springer Japan
Year: 1997
Tongue: English
Weight: 414 KB
Volume: 13
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01202233

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two counterfeit coins

✍ Ratko Tošić 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 413 KB

We consider the problem of ascertaining the minimum number of weighings which sufike to determine the counterfeit (heavier) coins ia a set of n coins of the same appearance, given a balance scale and the information that there are exactly two heavier coins present. An optimal procedure is constructe

Five counterfeit coins

✍ Ratko Tošić 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 307 KB

Three counterfeit coins problem

✍ Anping Li 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 210 KB

How to find many counterfeit coins?

✍ L. Pyber 📂 Article 📅 1986 🏛 Springer Japan 🌐 English ⚖ 252 KB

The general counterfeit coin problem

✍ Lorenz Halbeisen; Norbert Hungerbühler 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Given c nickels among which there may be a counterfeit coin, which can only be told apart by its weight being different from the others, and moreover b balances, what is the minimal number of weighings to decide whether there is a counterfeit nickel, if so which one it is and whether it is heavier o

On the conjecture at two counterfeit coi

On the conjecture at two counterfeit coins

✍ Anping Li 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Suppose among the given n coins there are two counterfeit coins, which are heavier (or lighter) than the normals. Denote by g,(n) the minimum number of weighings that suffice to search the two false coins by a balance. It is guessed that g&)=rlog,(;)l . This paper affirms the conjecture.