olymmath

CMO 1971 Problem 10

  • Paper

Suppose that nn people each know exactly one piece of information, and all nn pieces are different. Every time person AA phones person BB , AA tells BB everything that AA knows, while BB tells AA 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.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator ca-cmo/1971/p10 · Tag E9NJ84FABC · Edit this page on GitHub · Keys: j next, k previous