Abstract
Suppose among the given n coins there are two counterfeit coins, which are heavier (or lighter) than the normals. Denote by g 2( n) the minimum number of weighings that suffice to search the two false coins by a balance. It is guessed that g 2(n) = ⌈log 3( n 2)⌈ . This paper affirms the conjecture.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
