There are 100 prisoners assigned by numbers in 1 to 100 . Any number can be assigned to them . They need not be unique. They can talk one time before they assigned and then don't have any connection. Each one is requested to guess his number (they can use different strategies). He can see their numbers (but not their guess).
How can they do it so at least one of them guesses correctly his number?
If you get this puzzle , I get you a treat .
Answer for this would be posted in2 weeks time . All discussions are welcome .
Cheers,
Madhu
-Intelligent Prisoner
How can they do it so at least one of them guesses correctly his number?
If you get this puzzle , I get you a treat .
Answer for this would be posted in2 weeks time . All discussions are welcome .
Cheers,
Madhu
-Intelligent Prisoner
11 comments:
If all of them say the same number, for instance "1", a few of them might get lucky and get "1" when they are assigned.
Since they can see the other prisoners' numbers, they would stick to the first number and eventually one could get the same number. So, every prisoner should repeat the 1st prisoner's assigned number and eventually one might get the same number. (that's if I understood the problem correctly :-])
Edu ,
I encourage to put your name in the comment .
Now for your answer , the prisoners are intelligent . Both your answers go by guess and luck .
In the ex that you mentioned second,
what if the numbers are
1,2,2,2 2,....
Then none of them would get it correct .
The prisoners should come up with a strategy which would work for all situations such that at least one of them get it right.
Degressing... Why is Google putting up the ad "Take a fun romance quiz - GO" on your blog? What have you got to do with either fun or romance?
"Why is Google putting up the ad Take a fun romance quiz - GO"
-- too much .:(
I believe Google is 50 % correct , I know I am not funny ..
BTW , Did u have a chance to scratch ur brain for this puzzle . Was this also posted from Safari ?
What if the prisoner thinks this way.
I will get a different number than the other one. If all of them does not have the same no assigned.
<< Dexter >>
this should work for all cases and not go by any asumptions .
since the prisoners are allowed to talk once before assigning numbers,
they can ask for the number they want aparna
" since the prisoners are allowed to talk once before assigning numbers,
they can ask for the number they want"
The jailer would give them random numbers right . This is a bit mathematical . Try using some Maths.
What is the answer for this question? You told after two weeks you post the answer...I think now two and half weeks over...where is the answer?
Anonymous , Please let me know ur name .
I cant give you an answer becuase it will spoil the fun. But hint yes ..
Think on modulo aritmentic .
100 = 0 mod 100
Post a Comment