Abstract

We consider the problem of finding a pair of irregular boxes from a set of n boxes using a balance scale. One irregular box is heavier and the other lighter than a regular box but the total weight of the two irregular boxes is the same as the total weight of two regular boxes. Let N(w) denote the maximum number of boxes w weighings can handle. We give a weighing scheme such that N(2t) ≥3t for t ≥2 and N(2t + 1) ≥ 5.3t-1 for t ≥ 1. The N(2t) result meets the information-theoretic bound and hence is the best possible.

Full Text
Paper version not known

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 call

Disclaimer: 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.