1971 Canadian MO Problems/Problem 10

Revision as of 15:55, 12 September 2012 by 1=2 (talk | contribs)

Problem

Suppose that $n$ people each know exactly one piece of information, and all $n$ pieces are different. Every time person $A$ phones person $B$, $A$ tells $B$ everything that $A$ knows, while $B$ tells $A$ nothing. What is the minimum number of phone calls between pairs of people needed for everyone to know everything? Prove your answer is a minimum.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See Also

1971 Canadian MO (Problems)
Preceded by
Problem 9
1 2 3 4 5 6 7 8 Followed by
Last Question