Shoot me!!

Source: P. Winkler

In a room stand n armed and angry people. At each chime of a clock, everyone simultaneously spins around and shoots a random other person. The persons shot fall dead and the survivors spin and shoot again at the next chime. Eventually, either everyone is dead or there is a single survivor.

As n grows, what is the limiting probabality that there will be a survivor. :)

Treat at H8 canteen for the person solving it first :)

Comments

  1. A Rustle8:03 PM, October 12, 2009

    Is the answer 0?

    ReplyDelete
  2. Pratik Poddar9:53 PM, October 12, 2009

    nope :(

    ReplyDelete
  3. Pratik Poddar11:43 PM, October 14, 2009

    Since no one has been able to solve it till now, probably this would help.

    The limiting probability does not exist in the sense that the probability does not approach a unique value

    Since source is Winkler, you are sure that its correct :P

    ReplyDelete
  4. SB1236:03 AM, January 04, 2012

    Isn't it just e^-1 ??

    Because prob. of not being shot by a person when theyre are n people alive is 1-1/n

    Now prob. of at least one person alive we use inclusion exclsion principle, but when n is large this approx holds:

    Prob of not being shot is (1-1/n)^n after n round.

    So I get e^-1

    ReplyDelete

Post a Comment

Popular posts from this blog

Fraction Brainteaser

Source: Sent to me by Gaurav Sinha Problem: Siddhant writes a Maths test and correctly answers 5 out of 6 Arithmetic questions and 20 out of 28 Geometry questions.  In total, Siddhant scores 25 out of 34.  Vaibhav writes another Maths test and correctly answers 20 out of 25 Arithmetic questions and 6 out of 9 Geometry questions. in total, Vaibhav scores 26 out of 34. Note that a) Vaibhav scores more than Siddhant b) Siddhant score better than Vaibhav in both individual topics -  5/6 > 20/25 and 20/28 > 6/9 How is it possible? 
Read more

Buying Dimsums

Source: Alok Goyal (Stellaris VP, Ex-Helion VC) puzzle blog Problem: A fast food restaurant sells dimsums in boxes of 7 and 3. What’s the greatest number of dimsums a person cannot buy. Generalize it for p and q where p and q are relatively prime. I loved the puzzle. Hope you enjoy it too.
Read more

Consecutive Heads

Let's say A keep tossing a fair coin, until he get 2 consecutive heads, define X to be the number of tosses for this process; B keep tossing another fair coin, until he get 3 consecutive heads, define Y to be the number of the tosses for this process. 1) Calculate P{X>Y} 2) What's the expected value of X 3) What's the expected value of Y This is probably the hardest puzzle I have ever put on my blog. Hence, I will post its solution in the post directly rather than on comment. Solution: 1) (Solved by me finally after 13 months :)) Make a state diagram. Let the state be (a,b) where a is the number of consecutive heads streak "A" is on currently and b is the number of consecutive heads streak "B" is on currently. So, (0,3) (1,3) are final accepted states and (2,0) (2,1) (2,2) (2,3) are failure states. If you get tails, your contribution to the state reaches to "0" f(State) = P(X>Y | "State" configuration initially)
Read more