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

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.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top