MathDB
Gossip

Source: Turkey TST 1999 - P5

July 2, 2012
combinatorics proposedcombinatorics

Problem Statement

Each of AA, BB, CC, DD, EE, and FF knows a piece of gossip. They communicate by telephone via a central switchboard, which can connect only two of them at a time. During a conversation, each side tells the other everything he or she knows at that point. Determine the minimum number of calls for everyone to know all six pieces of gossip.