Conditional Probability with combinatorics

Click For Summary

Discussion Overview

The discussion revolves around calculating the conditional probability of drawing the ace of spades from a hand of 5 cards dealt from a 52-card deck, given that there is at least one ace in the hand. The conversation includes various approaches to the problem, exploring combinatorial methods and the application of conditional probability principles.

Discussion Character

  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant proposes a detailed breakdown of the probability P(E), where E is the event of having the ace of spades given at least one ace, using combinations to express various scenarios involving different numbers of aces.
  • Another participant suggests a simpler approach using the relationship between events A (at least one ace) and B (the ace of spades), stating that P(B|A) can be expressed as P(B) / P(A) and provides formulas for both probabilities.
  • A participant questions whether P(A and B) equals P(B) under the condition that A is defined as having exactly one ace, arguing that the presence of the ace of spades necessitates at least one ace in the hand.
  • Another participant reinforces the idea that P(A and B) equals P(B), explaining that the occurrence of B implies A, thus they are equivalent events.

Areas of Agreement / Disagreement

Participants express differing views on the relationship between the events A and B, particularly regarding whether P(A and B) can be equated to P(B) under the given conditions. The discussion remains unresolved with multiple competing interpretations of the problem.

Contextual Notes

Participants' calculations and reasoning depend on the definitions of events A and B, and there are unresolved assumptions regarding the interpretation of "at least one ace" versus "exactly one ace." The mathematical steps presented may also have limitations that are not fully explored.

dmpiq
Messages
2
Reaction score
0
If a hand of 5 cards are dealt from a 52 card pack (order doesn't matter), what is the probability that the hand will contain the ace of spades GIVEN that there is at least one ace?

Thanks.
 
Physics news on Phys.org
I am not certain of my sol'n , but this is what I think :


Let E represent the event that "In a hand of 5 cards from a 52 card pack (order doesn't matter), that the hand will contain the ace of spades GIVEN that there is at least one ace in the hand"

Let P(E) represent the probability that event E happens

Now since I donno how to use the Latex formatting , I am goin to use C(n,k) to represent the no of ways to select k things from a collection of n things.

i.e. C(n,k) = n! / { ( n-k)! * k! }

Now ,

P(E) = P(E given there is exactly one ace ) * P( there is exactly one ace given there is at least one ace)
+
P(E given there are exactly 2 aces ) * P( there are exactly 2 aces given there is at least one ace)
+
P(E given there are exactly 3 aces ) * P( there are exactly 3 aces given there is at least one ace)
+
P(E given there are exactly 4 aces ) * P( there are exactly 4 aces given there is at least one ace)


Now ,
P(E given there is exactly one ace ) = 1/4
P( there is exactly one ace given there is at least one ace) = C(3,0) * C(48,4) / C(51,4)




Similarly ,

P(E given there are exactly 2 aces ) = 2/4
P( there is exactly one ace given there is at least one ace) = c(3,1) * C(48,3) / C(51,4)

and so on ,

Thus :

P(E) = (1/4) * { C(3,0) * C(48,4) / C(51,4) } + (2/4) * { C(3,1) * C(48,3) / C(51,4) }

+ (3/4) * { C(3,2) * C(48,1) / C(51,4) } + (4/4) * { C(3,3) * C(48,0) / C(51,4) }
 
srijithu, your approach appears to be reasonable (although dmpiq said it was a 5 card hand not a 4 card hand). However, the problem isn't that complicated.

Let A = the event that there is at least once ace, and B = the event that there is the ace of spaces.
P(B|A) = P(A and B) / P(A)
Now, P(A and B) = P(B) since there is no way to get the ace of spaces without getting at least one ace. So we really just want P(B) / P(A).
P(B) = C(51,4) / C(52,5)
P(A) = 1 - P(zero aces) = 1 - C(48,5)/C(52,5)
P(B|A) = C(51,4)/(C(52,5)*(1-C(48,5) / C(52,5)))
 
Last edited:
Thanks for the replies, but isn't Pr(A and B) = Pr(B) if A is the event 'exactly one ace'? Here, it is at least one ace, so there can be 1 - 4 aces, but the ace of spades always has to be in the hand. Thus, the possible combinations can be:

Ace of Spades x another 4 cards
Ace of Spades x Ace of Hearts x Another 3 cards
Ace of Spades x Ace of Hearts x Ace of Diamonds x Another 2 cards
Ace of Spades x Ace of Hearts x Ace of Diamonds x Ace of of Clubs x Another card

Is this algorithm/method correct? Thanks.
 
To reiterate:
A = at least once ace
B = the ace of spades
P(A and B) = P(B). Why? Well, suppose your hand has the ace of spades. Then, it has the ace of spades and has at least one ace. Conversely, suppose your hand has the ace of spades and has at least one ace. Then, it has the ace of spades. So the event "B" happens if and only if the event "A and B" happens, so "B" and "A and B" are the same event, so P(A and B) = P(B).

Ah, I just realized I had a brain fart in my last post (not related to the above conceptual issue)... fixed
 
Last edited:

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 31 ·
2
Replies
31
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K