Answers are grounded in this paper and cite their sources.
The following problem due to A. Boyd, has enjoyed a certain popularity in recent months with several mathematicians. A different solution to the one given here has been given independently by R. T. Bumby and J. Spencer. The Problem, There are n ladies, and each one of them knows an item of scandal which is not known to any of the others. They communicate by telephone, and whenever two ladies make a call, they pass on to each other, as much scandal as they know at that time. How many calls are needed before all the ladies know all the scandal?
No takes yet. Share an insight, caveat, or question.
Hajnal et al. (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: