2009/05/01 by Eldin Wee Chuan Lim, Lim, Eldin Wee Chuan
Computer Science · Mathematics · #05A05 #Benford’s Law and Fraud Detection #Combinatorics (math.CO) #Currency Recognition and Detection #Digital Media Forensic Detection #FOS: Mathematics #math.CO #msc:05A05
paper · pdf · doi:10.48550/arxiv.0905.0085
arxiv created 2009/05/01 · openalex publication_date 2009/05/01 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We address a well-known problem in combinatorics involving the identification of counterfeit coins with a systematic approach. The methodology can be applied to cases where the total number of coins is exceedingly large such that brute force or enumerative comparisons become impractical. Based on the principle behind this approach, the minimum effort necessary for identification of the counterfeit coin can be determined and expressed as a simple relation. We further suggest a possible application of this methodology to error detection in quantum information processing.