2010/05/09 by Juan Dominguez-Montes, J. Domínguez-Montes, Dominguez-Montes, Juan
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #Mathematical Dynamics and Fractals #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1005.1391
arxiv created 2010/05/09 · openalex publication_date 2010/05/09 · arxiv updated 2010/05/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This work deals with a classic problem: "Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balance scales, with the minimum number of weighings possible, and indicate whether it weighs less or more than the rest". The method proposed here not only calculates the minimum number of weighings necessary, but also indicates how to perform these weighings, it is easily mechanizeable and valid for any number of coins. Instructions are also given as to how to generalize the procedure to include cases where there is more than one counterfeit coin.