Again for ur soln, if n is 2 and the numbers are : 2,1 None of them is correct.
My soln was in probabilistic terms. The probability of choosing a number x from 1 to N is 1/N, however you can give an example where you choose N numbers without choosing x at all. That is not the right way :) On Mon, Jul 5, 2010 at 9:02 AM, manoj janoti <m.jan...@gmail.com> wrote: > If all the men gusses the same number then the solution could be wrong. > > for example the the value of N is 5 and numbers given are 1,2,1,1,1 and > everybody guesses 4 then the solution is wrong. > > A different solution is like - All men will stand in a row and and > everybody can think of his hat number as his position in row. > > In this way atleast one person will be there who is correct. > > Manoj Janoti > > On Mon, Jul 5, 2010 at 3:19 AM, Nikhil Jindal <fundoon...@yahoo.co.in>wrote: > >> Hello All, >> >> Since duplicates are allowed, the fact that I can see the number on others >> hat is of no significance to me. My guess with this information is as good >> without it. >> >> Hence, I will consider the situation as: >> I am sitting alone in a dark room and I am given a hat with a number from >> 1 to N. I have to guess the number on my hat. >> I am in such a situation N times and I have to develop a strategy for >> guessing such that I am correct atleast once. >> Now if I guess a number x (1<=x<=N), my probability of correctness is 1/N >> i.e if I guess the same number N times, I will be correct once. >> Hence I guess the same number every time. >> >> For the given puzzle, all men guess the same number and at least one of >> them will be correct. :) >> >> Nikhil Jindal >> Department of Computer Engineering >> Delhi College of Engineering <http://www.dce.edu>, Delhi >> My Blog: http://fundoonick.blogspot.com >> My LinkedIn Profile: http://www.linkedin.com/in/nikhiljindal >> >> <http://www.linkedin.com/in/nikhiljindal> >> On Sun, Jul 4, 2010 at 11:05 PM, Dave <dave_and_da...@juno.com> wrote: >> >>> But everyone guesses simultaneously. I take it to mean that no one >>> knows anyone else's guess when making his own. >>> >>> Dave >>> >>> On Jul 4, 2:01 am, agnibha nath <agni.fl...@gmail.com> wrote: >>> > can it be like... one person sees any other person's number and >>> > guesses it first. then, everybody else guesses the same number. this >>> > way, atleast one guesses it right, since there is no boundation on the >>> > no. of wrong guesses. >>> > >>> > On Jul 3, 11:10 pm, jalaj jaiswal <jalaj.jaiswa...@gmail.com> wrote: >>> > >>> > >>> > >>> > > N people team up and decide on a strategy for playing this game. Then >>> they >>> > > walk into a room. On entry to the room, each person is given a hat on >>> which >>> > > one of the first N natural numbers is written. There may be duplicate >>> hat >>> > > numbers. For example, for N=3, the 3 team members may get hats >>> labeled 2, 1, >>> > > 2. Each person can see the numbers written on the others' hats, but >>> does not >>> > > know the number written on his own hat. Every person then >>> simultaneously >>> > > guesses the number of his own hat. What strategy can the team follow >>> to make >>> > > sure that at least one person on the team guesses his hat number >>> correctly? >>> > > -- >>> > >>> > > With Regards, >>> > > Jalaj Jaiswal >>> > > +919026283397 >>> > > B.TECH IT >>> > > IIIT ALLAHABAD- Hide quoted text - >>> > >>> > - Show quoted text - >>> >>> -- >>> You received this message because you are subscribed to the Google Groups >>> "Algorithm Geeks" group. >>> To post to this group, send email to algoge...@googlegroups.com. >>> To unsubscribe from this group, send email to >>> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >>> . >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >>> >> Please access the attached hyperlink for an important electronic >> communications disclaimer: >> http://dce.edu/web/Sections/Standalone/Email_Disclaimer.php >> >> >> >> >> -- >> >> >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> >> To post to this group, send email to algoge...@googlegroups.com. >> >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com >> <algogeeks%2bunsubscr...@googlegroups.com>. >> >> >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> >> > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > Please access the attached hyperlink for an important electronic communications disclaimer: http://dce.edu/web/Sections/Standalone/Email_Disclaimer.php -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
