✦ LIBER ✦

On a Problem of Coin Identification

✍ Scribed by G. J. Manas and D. H. Meyer

Book ID: 124939762
Publisher: Society for Industrial and Applied Mathematics
Year: 1989
Tongue: English
Weight: 328 KB
Volume: 31
Category: Article
ISSN: 0036-1445
DOI: 10.2307/2030850

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Generalised Two-Coin Tossing Proble

On a Generalised Two-Coin Tossing Problem

✍ Mohanty, S. G. 📂 Article 📅 1966 🏛 Wiley (John Wiley & Sons) ⚖ 319 KB

Problem 77-11, A Coin Tossing Problem

✍ Danny Newman 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 178 KB

On a coin tossing problem by G. Bennett

✍ Helge Tverberg 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 103 KB

Tverberg, H., On a coin tossing problem by G. Bennett, Discrete Mathematics 115 (1993) 293-294. For a certain class of games, Bennett proved that player B never has a smaller chance of winning than player A. Here we give a proof which keeps strictly to the original problem environment. Bennett [ 1

Identification of corrosion products on

Identification of corrosion products on a medieval copper-silver coin

✍ C. M. B. Martins; J. I. Martins 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 404 KB

On various versions of the defective coi

On various versions of the defective coin problem

✍ Richard Bellman; Brian Gluss 📂 Article 📅 1961 🏛 Elsevier Science ⚖ 547 KB

The average complexity of a coin-weighin

The average complexity of a coin-weighing problem

✍ L. Alonso; P. Chassaing; R. Schott 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 511 KB

Given a set of n coins, some of them weighing H , the others weighing h , h < H , we prove that to determine the set of heavy coins, an optimal algorithm requires an average of probabilities of being light and heavy. A simple quasi-optimal algorithm is described. Similar results are derived for th