# Accession Number:

## AD0604945

# Title:

## BALANCE SCALE SORTING,

# Descriptive Note:

# Corporate Author:

## RAND CORP SANTA MONICA CALIF

# Personal Author(s):

# Report Date:

## 1955-09-07

# Pagination or Media Count:

## 40.0

# Abstract:

Given 1 a set W of n objects, indistinguishable save that the members of a subset H of h objects are slightly heavier than the rest 2 a balance scale, one seeks weighing programs minimizing either Problem Mn,h the maximum number of weighings which may be required to cull out H or Problem En,h the expected number of such weighings. Problem Mn,1 is a familiar puzzle. Problem En,1 was solved under various hypotheses. Problem Mn,2 was partially solved. Some aspects of it require further investigation. The paper could be used as a basis for more research on Mn,h and En,h in general. Some of the techniques involve manipulations of series which may be applicable to other combinatorial problems. Author