Search for a majority element

A new short proof of a theorem of Saks and Werman is given about the number of weighings necessary and sufficient to determine a majority type coin among n coins of two possible weights by comparisons. A lower bound on the number of good algorithms is proved and further questions are posed about determining the majority in different weighing models.