An ordinary deck of 52 playing cards is randomly divided into 4 piles of 13 cards each . The probability that each pile has exactly 1 ace can be expressed as b a where a and b are coprime positive integers. Find a + b .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
awesome ...i had a solution but it was too long as compared to this ....just a little typo in the last line making the answer 23022
Log in to reply
Thanks for spotting the typo...
Log in to reply
hmmm....but still i think there is typo...it should be 23022
Log in to reply
@Ujjwal Mani Tripathi – Starwar, please, could you write your solution, please? I would like to see it... Please, take the time you need.
Define events E_i such that i = 1 , 2 , 3 , 4 as follows .
E 1 = the ace of spades is in any one of the piles .
E 2 = the ace of spades and the ace of hearts are in different piles
E 3 = the ace of spades , hearts and diamonds are all in different piles
E 4 = all 4 aces are in different piles
The probability desired is P ( E 1 E 2 E 3 E 4 ) and by multiplication rule
P ( E 1 E 2 E 3 E 4 ) = P ( E 1 ) ∗ P ( E 2 ∣ E 1 ) ∗ P ( E 3 ∣ E 2 E 1 ) ∗ P ( E 4 ∣ E 3 E 2 E 1 )
Now , P ( E 1 ) = 1 , since E 1 is the sample space S .
P ( E 2 ∣ E 1 ) = 5 1 3 9 , since the pile containing the ace of spades will receive 1 2 out of remaining 5 1 cards .
P ( E 3 ∣ E 2 E 1 ) = 5 0 2 6 , since the pile containing the ace of spades and hearts will receive 2 4 of the remaining 5 0 cards ; and finally...
P ( E 4 ∣ E 3 E 2 E 1 ) = 4 9 1 3
Therefore , we obtain that the probability that each pile has exactly 1 ace is
P ( E 1 E 2 E 3 E 4 ) = 5 1 ∗ 5 0 ∗ 4 9 3 9 ∗ 2 6 ∗ 1 3 = 2 0 8 2 5 2 1 9 7
Thus the final answer becomes = 2 3 0 2 2
I have liked, thank you, I'm going to delete my report
Log in to reply
oh no... please wait lets figure out what was the fault in that....
Log in to reply
I have deleted it, sorry
Log in to reply
@Guillermo Templado – no problem then...i'll soon come up with a similar note on why was your approach wrong
Log in to reply
@Ujjwal Mani Tripathi – No, please, I want to be calm, I have a lot of problems...I don't want another discussion, etc...
Log in to reply
@Guillermo Templado – alright friend i will wait
Let's consider the aces as identical cards. If we display the 52 cards along a line, there are ( 4 5 2 ) ways to place the 4 identical aces.
Now, we cut the line into 4 groups of 13 cards. If we want the aces to be in each group, we have 13 places for each ace per group.
The result is then ( 4 5 2 ) 1 3 4 = 2 7 0 ′ 7 2 5 2 8 ′ 5 6 1 = 2 0 ′ 8 2 5 2 ′ 1 9 7 .
Problem Loading...
Note Loading...
Set Loading...
There are 1 3 ! × 1 3 ! × 1 3 ! × 1 3 ! 5 2 ! ways of splitting the pack into 4 piles of 1 3 , and there are 4 ! × 1 2 ! × 1 2 ! × 1 2 ! × 1 2 ! 4 8 ! ways of splitting the pack so that there is one Ace in each pile (there are 4 ! ways of distributing the Aces amongst the piles, and then ( 1 2 ! ) 4 4 8 ! ways of distributing the remaining cards amongst the four piles).
Thus the probability that there is one Ace in each pile is 4 9 × 5 0 × 5 1 × 5 2 4 ! × 1 3 4 = 2 0 8 2 5 2 1 9 7 making the answer 2 3 0 2 2 .