MHB 7 Students, 7 Exercises: Min Phone Calls Needed?

Click For Summary
Seven university students need to share solutions for seven exercises, with each solving one exercise. The minimum number of phone calls required for all students to obtain all solutions is 11, achieved by a slight adjustment from a 12-call strategy. The discussion references the "gossip problem," where the optimal solution involves using four coordinators to minimize communication. The established formula for the minimum calls is 2n-4, where n is the number of students. This highlights the efficiency of strategic coordination in problem-solving scenarios.
jmprada
Messages
2
Reaction score
0
7 University students have to solve 7 hard exercises. In order to save time, they have decided to share them, so that each of them solves exactly one exercise. Then they will communicate via telephone, so as to share the solutions to the rest of the exercises. What is the minimum number of phone calls they need to exchange, so that each student has all 7 solutions? Note that each phone call is exactly between 2 students only (and they cannot communicate by any other means).
 
Physics news on Phys.org
jmprada said:
7 University students have to solve 7 hard exercises. In order to save time, they have decided to share them, so that each of them solves exactly one exercise. Then they will communicate via telephone, so as to share the solutions to the rest of the exercises. What is the minimum number of phone calls they need to exchange, so that each student has all 7 solutions? Note that each phone call is exactly between 2 students only (and they cannot communicate by any other means).
Suppose that one of the students acts as a coordinator. She phones each of the other six in turn to obtain their solutions. Once she knows all the answers, she can then phone each of the others again to give them the solutions. That gives 12 calls in all. But by a very small adjustment you can reduce the number to 11.

I don't know if that is the best possible strategy, but it gives you a starting point to test other strategies against.
 
This is called the gossip problem, and the minimum number of calls is $2n-4$ where $n$ is the number of students. This number is achieved with four coordinators.
 
There is a nice little variation of the problem. The host says, after you have chosen the door, that you can change your guess, but to sweeten the deal, he says you can choose the two other doors, if you wish. This proposition is a no brainer, however before you are quick enough to accept it, the host opens one of the two doors and it is empty. In this version you really want to change your pick, but at the same time ask yourself is the host impartial and does that change anything. The host...

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
Replies
7
Views
2K
  • · Replies 7 ·
Replies
7
Views
4K
Replies
4
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
3
Views
5K
Replies
9
Views
2K
Replies
29
Views
4K
Replies
1
Views
2K
Replies
2
Views
387