perplexus.info :: Just Math : Gossip

Gossip (Posted on 2012-07-26)

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: ( You must be logged in to post comments.)

Subject	Author	Date
re(3): Solution	Dej Mar	2012-07-29 09:50:23
re(2): Solution	Hugo	2012-07-27 18:39:10
re: Solution	Dej Mar	2012-07-27 17:48:28
gossip problem	Katie B	2012-07-27 17:03:41
re(4): solution, some doubts, some doubts	Hugo	2012-07-27 16:46:48
re(3): solution, some doubts	Dej Mar	2012-07-27 15:29:18
Solution	Hugo	2012-07-27 13:02:43
re(2): solution, some doubts	Steve Herman	2012-07-26 18:52:32
re(2): solution, some doubts......a hint	Ady TZIDON	2012-07-26 14:19:59
re: solution, some doubts	Hugo	2012-07-26 13:36:13
solution	Dej Mar	2012-07-26 12:35:33
Upper limit (spoiler?)	Steve Herman	2012-07-26 11:35:30

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

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

Chatterbox:


perplexus dot info