You are not logged in. Please login at to post your questions!


Minimum Number of Calls to be made ?

There are 'n' number of detectives..each one knows an information, how many minimum calls should they make so all the detectives know all the n number of information ?

My answer: I came up with 2n-3 (that is, n-1 + n-2) solution where a detective calls n-1 other detectives and shares information mutually (in this way the last detective and the first has all the information). Then the remaining n-2 detectives who doesn't have the whole data calls either the first detective or the last to gain the remaining information.

asked 28 Sep '13, 23:31

saikiranboga11's gravatar image

accept rate: 0%

edited 28 Sep '13, 23:33

@saikiranboga11 : Hello , sorry my earlier comment was wrong so I have deleted it.
The paper you mentioned is about a must broader result and hence is difficult to follow .
If you are just interested in the base problem , have a look at this paper
It has a one page solution and is easily followable
Hope that helps .


answered 29 Sep '13, 07:20

vineetpaliwal's gravatar image

accept rate: 12%

toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:


question asked: 28 Sep '13, 23:31

question was seen: 2,201 times

last updated: 29 Sep '13, 07:20