Some Results on the Counterfeit Coins Problem II

2009/03/11 by An-Ping Li, Li, An-Ping
Mathematics · #05A05 #68E05 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05A05 #msc:68E05

paper · pdf · doi:10.48550/arxiv.0903.1913

In the new version, the result g_1(76|_22)=87 has been improved to g_1(76|_19)=75

arxiv created 2010/08/04 · arxiv updated 2010/08/05

Abstract

In this paper, we will continue to estmate g₁(n|m) for general n and m.

Related

• Some Results on the Counterfeit Coins Problem
• An improved lower bound on the counterfeit coins problem
• A note on the counterfeit coins problem
• Solution to the Counterfeit Coin Problem and its Generalization
• Counting Counterfeit Coins: A New Coin Weighing Problem