Re: A card game probability
- From: matt271829-news@xxxxxxxxxxx
- Date: 26 Jan 2007 07:15:45 -0800
On Jan 26, 11:42 am, "Faton Berisha" <fberi...@xxxxxxxxxx> wrote:
On Jan 25, 9:25 pm, "jsepp...@xxxxxxxxx" <jsepp...@xxxxxxxxx> wrote:
Take a card deck with 52 cards. Pick cards one by one and compute the
cards by ace, two, three,..., jack, queen, king, ace,..., king, ace,
..., king, ace, ..., king. What is the probability that at least once
you turn a card of the same value as you say aloud?
The probability that you turn the first card of the same value as one
of the n cards turned before exactly in your (n+1)-st trial is
p_n = 3n/(52-n) prod_{j=1}^{n-1}(1-3j/(52-j)).
Hence, the probability that you turn such a card in n trials is
sum_{j=1}^{n-1} p_j.
Can you explain what this has to do with the problem posed? What is the
value of n supposed to be? What answer do you get from this formula? I
would expect the correct answer to be approximately 1 - (12/13)^52.
This would be the answer if all the probabilities were independent
(which of course they aren't).
.
- Follow-Ups:
- Re: A card game probability
- From: David Bernier
- Re: A card game probability
- From: Faton Berisha
- Re: A card game probability
- References:
- A card game probability
- From: jseppa17@xxxxxxxxx
- Re: A card game probability
- From: Faton Berisha
- A card game probability
- Prev by Date: Re: algebra with order 160.
- Next by Date: Re: Basic set theory question
- Previous by thread: Re: A card game probability
- Next by thread: Re: A card game probability
- Index(es):