Suppose that there are n people in a group, each aware of a different secret no...

50.1K

Verified Solution

Question

Advance Math

Suppose that there are n people in a group, each aware of adifferent secret no one else in the group knows about. These peoplecommunicate by phone; when two people in the group talk, they shareinformation about all secretes each knows about. For example, onthe first call, two people share information, so by the end of thecall, each of them knows about two secretes. The gossip problemasks for the number of phone calls that are needed for all n peopleto learn about all the secrets.

(a) Find the smallest number of telephone calls when there are 3and 4 people respectively. [2 marks]

(b) Prove by induction that the total number of phone calls forall n people to learn about all secretes is not more than 2n−4 forany n ≥ 4.

Answer & Explanation Solved by verified expert
3.6 Ratings (369 Votes)
Please feel free    See Answer
Get Answers to Unlimited Questions

Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!

Membership Benefits:
  • Unlimited Question Access with detailed Answers
  • Zin AI - 3 Million Words
  • 10 Dall-E 3 Images
  • 20 Plot Generations
  • Conversation with Dialogue Memory
  • No Ads, Ever!
  • Access to Our Best AI Platform: Flex AI - Your personal assistant for all your inquiries!
Become a Member

Other questions asked by students