On Anomaly Identification and the Counterfeit Coin Problem

Simple item page
dc.creatorLim, Eldin Wee Chuan
dc.date2009-05-01
dc.date.accessioned2026-07-07T13:11:00Z
dc.date.available2026-07-07T13:11:00Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0905.0085
dc.identifierhttp://arxiv.org/abs/0905.0085
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229158
dc.subjectCombinatorics
dc.subject05A05
dc.titleOn Anomaly Identification and the Counterfeit Coin Problem
dc.typetext

Files

Collections

arXiv