Derangement - Complete FAIL!

Source: Interview at one of the quant firms

Problem:
As posted in problems this and this, this is an extension to the derangement problem.
There are n men, n hats, one hat belonging to each person. A random permutation of hats is picked by the men. What is the probability that no person gets the correct hat?

Update (March 6, 2011)
Solution: Posted by Vipul Verma (Engineer at Portware, IIT KGP and University of South California Alumnus) in comments!

Comments

  1. Vipul6:31 AM, March 06, 2011

    The number of arrangements so that no one gets his own hat = n!*(1 - 1/1! + 1/2! - 1/3! + 1/4! ..... + (-1)^n/n!)

    Total number of arrangements = n!

    The prob that this happens = (1 - 1/1! + 1/2! - 1/3! + 1/4! ..... + (-1)^n/n!)


    Easy one....

    ReplyDelete
  2. Pratik Poddar4:23 PM, March 06, 2011

    Yes, easy one. Direct application of Inclusion Exclusion Principle. :)

    But your answer is wrong.

    Prob that no one gets his own hat = 1 - (Prob that at least one correct hat) = 1 - (nC1*1/n - nC2*1/(n*n-1) +..) = 1 - (1 - 1/2! + 1/3! .. ) = 1 - 1/e
    Prob: 1-1/e

    Your solution gives the probability that at least one person gets the correct hat.

    ReplyDelete
  3. Vipul3:52 AM, March 08, 2011

    Pratik, how is my answer wrong? How my soln is giving the prob. that at least one person gets the correct hat.

    If you look closely the expression you have got is same as what I got. The only difference is that expression has infinite terms which I don't understand why.

    Your series should not go to infinity. It should stop at n.

    ReplyDelete
  4. anujjain10:18 AM, March 08, 2011

    Pratik, if you see yours and vipul's answer are actually same.

    ReplyDelete
  5. Pratik Poddar11:31 AM, March 08, 2011

    I am sorry. My apologies.
    Yes your solution is correct. Our answers are same. Also, I should not have taken infinite terms. Thanks.

    ReplyDelete
  6. Unknown1:32 AM, March 11, 2011

    1 - 1/2! + 1/3! .. = 1 - 1/e, and so the prob for no one get it right should be 1/e, right...?

    ReplyDelete
  7. Pratik Poddar1:15 PM, March 13, 2011

    @Yun.
    Yes you are correct.

    For large n

    Prob that no one gets his own hat = 1 - (Prob that at least one correct hat) = 1 - (nC1*1/n - nC2*1/(n*n-1) +..) = 1 - (1 - 1/2! + 1/3! .. ) = 1 - (1-1/e)
    Prob: 1/e

    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