A note on the counterfeit coins problem
An-Ping Li
TL;DR
This paper introduces an algorithm for identifying counterfeit coins when the exact number of false coins is unknown, addressing a classic problem in coin weighing puzzles.
Contribution
It presents a novel algorithm that effectively solves the counterfeit coins problem without prior knowledge of the number of false coins.
Findings
Algorithm successfully identifies counterfeit coins in various scenarios.
Reduces the number of weighings compared to previous methods.
Applicable to cases with unknown false coin count.
Abstract
In this paper, we will present an algorithm to resolve the counterfeit coins problem in the case that the number of false coins is unknown in advance.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSARS-CoV-2 detection and testing · Recycling and Waste Management Techniques · Extraction and Separation Processes