In a bag, there are 12 balls, with three balls colored blue, three colored red, three colored yellow, and three colored black. I draw 4 balls in succession without replacement. The probability that the first is not blue, the second is not red, the third is not yellow, the fourth is not black and all four balls are different-colored can be expressed as q p for positive coprime integers p and q . Find p + q .
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.
Excellent!!!!!!!!
This problem based on derangement. Assume that position 1st is blue , 2 - red and so on...
P(E)= no of derangement of 4 balls* no of ways of choosing ball of each color/ total combinations.
= 9 ∗ 3 C 1 ∗ 3 C 1 ∗ 3 C 1 ∗ 3 C 1 / ( 1 2 C 4 ∗ 4 ! ) = 27/440
but how 9 *3c1 * 3c1................. I got 6 * 3c1 * 3c1...........instead
This approach works for discussing more complicated patterns of balls too.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 |
|
Hey Daniel, would you please post this solution about this problem because my approach is really a mess. It's kind like 'brute force' method because I used Excel to tackle this problem. I believe your solution is more elegant than mine. Thank you... :)
UPDATE :
Let P be the probability that the first is not blue, the second is not red, the third is not yellow, the fourth is not black and all four balls are different-colored, then
P = ! 4 ⋅ 1 2 3 ⋅ 1 1 3 ⋅ 1 0 3 ⋅ 9 3 = 9 ⋅ 1 2 3 ⋅ 1 1 3 ⋅ 1 0 3 ⋅ 9 3 = 4 4 0 2 7 .
For what it's worth, I get a probability of 1 4 7 / 4 4 0 .
Log in to reply
That's funny. What is your solution?
EDIT: oh shoot, really sorry for your lost rating, I see what I did wrong. I will add an extra condition to the problem that will fix it.
Again, sorry :(
Log in to reply
Don't worry about it; I don't care about my rating that much. But it is important to state the problem correctly, so it's good that you fixed the problem.
Problem Loading...
Note Loading...
Set Loading...
First, we find that the total number of possibilities to pick the balls are 1 2 × 1 1 × 1 0 × 9 = 1 1 8 8 0
Let us consider one configuration first. (The subscript denotes which ball it is since there are three balls)
Let b 1 denote blue, y 1 yellow, r 1 red and bl 1 black.
We want these balls to NOT be in the same original position. This can be done in D e r ( 4 ) = ! 4 = 9 ways where D e r is the derangement function.
Now, how many such configurations are there? Well, for the first position we have 3 choices, 3 for the second and so on. Thus, 3 4 choices. For example, we have to derange
and so on...
Thus, the total number of ways are 3 4 × 9 .
Our answer is thus 1 1 8 8 0 3 4 × 9 = 4 4 0 2 7 giving us 2 7 + 4 4 0 = 4 6 7