Each of 10 friends knows some item of gossip not known to the others. They communicate by telephone, and in each call the two friends on the line share everything they have heard thus far. What is the smallest number of calls that can be made, such that by the end, everyone knows everything?
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.
Suppose everybody has following gossip :
a,b,c,d,,e,f,g,h,j,k
now if person with knowledge a calls person with knowledge b , then person(a) will have a+b knowledge and same person(b) will have , Similarly in next 3 calls of person(a) with person(c) ,(d) and (e),, person(a) and person(e) will have a+b+c+d+e knowledge . If same scenario happens in other half row (k calling j,h,g,f) then person(k) and person (f) have f+g+h+j+k knowledge .
Till now 8 calls have been made . Now if person(a) and person(k) calls then they both will know every gossip , similarly if person(e) and person(f) calls then they will know every gossip.
Total calls : 10 and a,e,f,k knows full gossip . Now if remaining persons i.e (b,c,d,g,h,j ) will call anyone from (a,e,f,k) they will know every gossip .
So total calls will be 10+ 6 =16
Enjoy ;)