3rd CaMO 1971 Problem 10 n people each have exactly one unique secret. How many phone calls are needed so that each person knows all n secrets? You should assume that in each phone call the caller tells the other person every secret he knows, but learns nothing from the person he calls.