arXiv · 1409.0250
Coins of Three Different Weights
Abstract
We discuss several coin-weighing problems in which coins are known to be of three different weights and only a balance scale can be used. We start with the task of sorting coins when the pans of the scale can fit only one coin. We prove that the optimal number of weighings for $n$ coins is $\lceil 3n/2\rceil -2$. When the pans have an unlimited capacity, we can sort the coins in $n+1$ weighings. We also discuss variations of this problem, when there is exactly one coin of the middle weight.
Explore related subjects
Keep this discovery
Tanya Khovanova, Konstantin Knop. 2014-08-31. Coins of Three Different Weights. https://arxiv.org/abs/1409.0250
Cite the original work for its findings. Save a collection to share your selection of sources.