Some Results on the Counterfeit Coins Problem II
An-Ping Li
TL;DR
This paper advances the understanding of the counterfeit coins problem by providing new estimates for the function g_1(n|m) across various values of n and m.
Contribution
It introduces improved methods for estimating g_1(n|m) for general n and m, extending previous results in the counterfeit coins problem.
Findings
New estimates for g_1(n|m) for various n and m
Extended the theoretical understanding of counterfeit coin detection
Provided bounds that improve upon previous results
Abstract
In this paper, we will continue to estmate g_1(n|m) for general n and m.
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
TopicsLimits and Structures in Graph Theory · Analytic Number Theory Research · graph theory and CDMA systems