All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Gossip (Posted on 2012-07-26) Difficulty: 3 of 5
n people know each a different piece of gossip.

They can phone each other and exchange all they know so that after the call the parties know anything that either of them knew before the call.

What is the smallest number of calls needed so that everyone knows everything and how is this number achieved?

No Solution Yet Submitted by Ady TZIDON    
Rating: 4.5000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Solution | Comment 6 of 12 |
For 16 people, it is possible to do it in 28 calls.

Let 4 people be named A, B, C, D and 12 people get numbers from 1 to 12.

Call 1 to 12: A calls all of the number people and A has now all the number information +A information.

Call 13 to 16: A, B, C and D exchange information according to my earlier post.  A,B,C and D have all information.

Call 17 to 28: A calls all of the number people again.

Looking at it for 5 people: A will do 1 call + ABCD do 4 calls +A does one more call.  The system seems to work for all values where n>4.

So the total will be (n-4) + 4 + (n-4)= 2n-4

  Posted by Hugo on 2012-07-27 13:02:43
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information