Difference between revisions of "1971 Canadian MO Problems/Problem 10"
(I LEAVE THIS PROBLEM OPEN. COME SOLVE IT.) |
m |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | + | Suppose that <math>n</math> people each know exactly one piece of information, and all <math>n</math> pieces are different. Every time person <math>A</math> phones person <math>B</math>, <math>A</math> tells <math>B</math> everything that <math>A</math> knows, while <math>B</math> tells <math>A</math> 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 == | == Solution == | ||
| Line 6: | Line 6: | ||
== See Also == | == See Also == | ||
| − | {{Old CanadaMO box|num-b=9| | + | {{Old CanadaMO box|num-b=9|after=Last Question|year=1971}} |
[[Category:Intermediate Combinatorics Problems]] | [[Category:Intermediate Combinatorics Problems]] | ||
Revision as of 14:55, 12 September 2012
Problem
Suppose that 
people each know exactly one piece of information, and all pieces are different. Every time person 
phones person 
, tells everything that knows, while tells 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 |
