Given a set of n elements each of which is either red or blue, it is k
nown that n-nu(n) pairwise equal/not equal colour comparisons are nece
ssary and sufficient to determine the majority color, where nu(n) is t
he number of 1-bits in the binary representation of n. We present a ne
w, simple proof of this lower bound.