Order of cards

Source: Asked to me by Prateek Srivastava (CSE IITB Alumnus & Yahoo! Software Engineer)

Problem:

I have ten cards, Ace,2,3,4,5,6,7,8,9,10. The value of the Ace is 1.

They’re shuffled, then dealt one by one, face up. For the first card, you automatically win $10. For the next 9 cards, if the card face-up is greater than every previous card, you win $10 more.

What is the expected winning amount?

Clarification:
1) Game does not end when you draw a card that is not a winning card. ie, if I pick a 5 first, then a 6, then a 4, the game is not over. I keep drawing until all of the cards are gone
2) It might be useful to know that the chance of winning $100 is 1/10!, because the cards will have to be drawn in the order: {A, 2, 3, 4 … , 9, 10}.

Update (Dec 08, 2010)

Solution: Posted by Goutham Valeti (Aero IITB Alumnus, Fair Issac Research Scientist) in comments! A more mathematical solution posted by me in comments!

Comments

  1. Goutham2:46 PM, December 07, 2010

    Another solution (Already seen yours, which is a lot sleeker I must say .. but I had to prove to Prateek that it could be done this way too! :D)

    So lets say E(n) is the expected value of winnings for the same game involving n cards

    So E(1) = 10

    E(2) = 15 [10 if its 2,A, 20 if its A,2] and so on..

    One thing to note is that once the Highest card (10) appears there is no chance of winning any more money.

    Now for E(10)

    Probability that 10 appears in the first draw = 1/10
    Money won = 10$

    Probability that 10 appears in the second draw = 1/10
    Money won = 10$ (for 2nd draw) + (Money won in first draw)

    Probability that 10 appears in the third draw = 1/10
    Money won = 10$ (for 3nd draw) + (Money won in first 2 draws)

    Probability that 10 appears in the fourth draw = 1/10
    Money won = 10$ (for 4th draw) + (Money won in first 3 draws)

    Now we have to calculate the "Money won in the first i draws", This can be mapped back to the original game.
    For example, lets look at the last case, That 10 appears in the 4th draw, so any 3 cards can appear in the first 3
    draws, these 3 cards can be mapped to A,2,3 and Expected Value of winnings is just E(3) and similarly for all cases

    so now

    E(10) = 1/10*(10) + 1/10*(10 + E(1)) + 1/10*(10 + E(2)) + .... + 1/10*(10 + E(9))

    For a general n

    n*E(n) = 10 + (10 + E(1)) + ... + (10 + E(n-1))
    n+1*E(n+1) = 10 + (10 + E(1)) + ... + (10 + E(n-1)) + (10 + E(n))

    => n+1(E(n) - E(n+1)) = 10

    => E(n+1) - E(n) = 10/(n+1)

    => E(10) - E(1) = 10/2 + 10/3 + 10/4 + .. + 10/10

    => E(10) = 10(1 + 1/2 + 1/3 + ... + 1/10)

    ReplyDelete
  2. Pratik Poddar10:15 AM, December 08, 2010

    @Goutham (Scrouge of God)..
    Your solution is correct.

    Just for clarity, the solution I gave to Prateek was:

    Let the random variable Xi be the amount in dollars I get in the ith draw.
    So, X1=10
    X2, X3 .. etc are not independent

    X= X1+X2+X3+.. X10
    We need to find E[X]

    Note that E[Xi]=10*P(last number is the largest if I draw i numbers from a set of n numbers) = 10*1/i

    So, E[Xi]=10/i
    E[X1]=10
    E[X2]=10/2
    E[X3]=10/3
    and so on

    By linearity of expectation,
    E[X]=10(1+1/2+1/3+1/4..+1/10)

    Hence proved.
    I agree with Goutham that my solution is sleeker :P. Thanks.

    ReplyDelete
  3. Shantanu1:50 AM, December 25, 2010

    106,286,400 / 10!, if you may!

    ReplyDelete
  4. Pratik Poddar2:23 AM, December 25, 2010

    @Gangal. :P

    On doing more calculations, another sleeker representation is 29.2896825.

    We could have guessed this using the following line of thought:

    (We know that!) H(n)-ln(n) reduces monotonically to Euler Mascheroni constant (0.577)

    H(10)-ln(10) < H(5)-ln(5)

    So, H(10) < ln(2)+1+0.5+0.33+0.25+0.2

    H(10) < 2.28+ln2 < 2.98

    Also, H(10)-ln(10) > 0.577

    H(10) > 2.879

    So, we could have guessed that our answer 10*H(10) lies between 28.79 and 29.8
    [Not a bad estimation!]

    [Of course, you needed to know the values of ln(10) and ln(2) for this, which I happened to remember from JEE days]

    ReplyDelete

Post a Comment

Popular posts from this blog

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

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

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