Math town has 1990 residents. Everyday the residents would tell all of their friends about the gossip they heard yesterday. If there is a gossip, it is guaranteed that all residents will know it from the friends over time.
If a gossip is told to 180 residents on day 0, the next day(day 1) the 180 residents will tell all their friends about it, and the day after that(day 2) all of the residents who knew the gossip will start talking about it to their friends. This process continue for 10 days.On day 10, is it guaranteed that all of the 1990 residents in Math Town knew the gossip?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Here's a counter example: Give each resident a number, 1 through 1 9 9 0 . Say we create a friendship between residents n and n + 1 for all n from 1 to 1 9 8 9 . Clearly, if there is gossip all residents will know it after a finite amount of time.
Now, suppose gossip is told to residents 1 through 1 8 0 . Then, only one new person learns the gossip every day, so by day 1 0 not everybody knows the gossip.