MHB What Is the Probability Distribution for Drawing Spades Without Replacement?

Roohul Amin
Messages
5
Reaction score
0
Dear All sorry for repeated post;
There is a problem
Problem: Three cards are drawn in succession from a deck without replacement. find the probability distribution for the number of spades.
I have come with this solution.
Let S1: appearance of spade on first draw S2: appearance of spade on 2nd draw S3: appearance of spade on 3rd draw
S01: No spade on 1st draw S02: No spade on 2nd draw
P(S1)=13/52
P(S2)=P(S2/S1)+P(S2/S0)=12/51+13/51
P(S3)=P(S3/S01*S02)+P(S3/S1*S02)+P(S3/S1*S2)=13/50+12/50+11/50

Need your opinion Please!
 
Mathematics news on Phys.org
Hi there,

So a probability distribution is a function of some kind of input parameter(s). Are you asking what is the probability of drawing three spades or trying to generalize the distribution in terms of the three draws?

In either case the final result would be a multiplication, not a sum. I think you are in the right direction but some clarification on the question would be helpful.

If you want an exhaustive list of possible outcomes, the event is spade/no spade, so the total number of outcomes is $2^3=8$.
 
Thanks for your reply Jamson: it seems the hyper-geometric distribution fit well this situation, what do you think?
 
Roohul Amin said:
Dear All sorry for repeated post;
There is a problem
Problem: Three cards are drawn in succession from a deck without replacement. find the probability distribution for the number of spades.
I have come with this solution.
Let S1: appearance of spade on first draw S2: appearance of spade on 2nd draw S3: appearance of spade on 3rd draw
S01: No spade on 1st draw S02: No spade on 2nd draw
P(S1)=13/52
P(S2)=P(S2/S1)+P(S2/S0)=12/51+13/51
P(S3)=P(S3/S01*S02)+P(S3/S1*S02)+P(S3/S1*S2)=13/50+12/50+11/50

Need your opinion Please!
I am not entirely sure that I understand the question. But I think that it is asking for the probabilities for drawing 0, 1, 2 or 3 spades.

Let $P(n)$ denote the probability of drawing $n$ spades. Then $P(0) = \dfrac{39 \cdot 38 \cdot 37}{52 \cdot 51 \cdot 50} \approx 0.4135$.

For $P(1)$ we have to draw one spade and two non-spades. There are three possibilities, since the one spade could be either the first, the second or the third card drawn. So $P(1) = \dfrac{3 \cdot 39 \cdot 38 \cdot 13}{52 \cdot 51 \cdot 50} \approx 0.4359.$

In a similar way, you can calculate $P(2)$ and $P(3)$.

If I am interpreting the question correctly, you answer should be the set of four probabilities $P(0),\ldots,P(3)$. As a check, you should verify that your four probabilities add up to $1$.
 
Last edited:
in the denominator the values are clearly 52C3. But the values in numerator i.e 3.52.52.39 are making some confusion to me, would you pleas give details. Thanks
 
Roohul Amin said:
in the denominator the values are clearly 52C3. But the values in numerator i.e 3.52.52.39 are making some confusion to me, would you pleas give details. Thanks
Sorry, my mistake. I should have written 3.39.38.13 there (I have now corrected it). The idea is that if you want just one of the three cards to be a spade, then you have 39 choices for the first non-spade, 38 for the second non-spade, and 13 for the spade. The 3 (as I mentioned in my previous comment) comes from the fact that the spade could be either the first, the second, or the third card to be chosen.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top