7 Students, 7 Exercises: Min Phone Calls Needed?

  • Context: MHB 
  • Thread starter Thread starter jmprada
  • Start date Start date
  • Tags Tags
    Exercises students
Click For Summary
SUMMARY

The discussion centers on the "gossip problem," where 7 university students need to share solutions to 7 exercises using the minimum number of phone calls. The optimal strategy involves using four coordinators, resulting in a total of 10 phone calls, which is derived from the formula $2n-4$ for n students. The initial approach of one coordinator resulted in 12 calls, but adjustments can reduce this to 11. This problem illustrates efficient communication strategies in group settings.

PREREQUISITES
  • Understanding of combinatorial optimization
  • Familiarity with the gossip problem concept
  • Basic knowledge of communication theory
  • Ability to analyze algorithms for efficiency
NEXT STEPS
  • Research the gossip problem and its variations
  • Explore combinatorial optimization techniques
  • Learn about efficient communication protocols in distributed systems
  • Investigate algorithms that minimize communication costs
USEFUL FOR

Mathematicians, computer scientists, and anyone interested in optimization problems and communication efficiency in group dynamics.

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.
 

Similar threads

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