Question
Question: Seven white balls and three black balls are randomly placed in a row. The probability that no two bl...
Seven white balls and three black balls are randomly placed in a row. The probability that no two black balls are placed adjacently equals
A.\left( 1 \right)$$$\dfrac{1}{2}$
B.\left( 2 \right)\dfrac{7}{{15}}$
C.$$\left( 3 \right)\dfrac{2}{{15}}
D.$$\left( 4 \right)$$$\dfrac{1}{3}
Solution
Hint : We have to find the required probability . We solve this question using the concept of probability and also the concept of arrangements of the balls using permutation and combination . We firstly find the total possible arrangements and also the favourable outcomes using the formula of combination . The probability is given by favourable outcomes to the total possible arrangements.
Complete step-by-step answer :
Given :
Total balls = 7 + 3
= 10
Total ways of arrangements of the balls in a row = 10C3
Using the formula of combination
nCr= r! × (n − r)!n!
Applying the formula , we get
The total ways of arrangements of the ball in a row = ( 3! × 7! )10 !
= 120
As given in the question no two black balls are placed adjacently , then the arrangement is as shown
\\_{\text{ }}W{\text{ }}\\_{\text{ }}W{\text{ }}\\_{\text{ }}W{\text{ }}\\_{\text{ }}W{\text{ }}\\_{\text{ }}W{\text{ }}\\_{\text{ }}W{\text{ }}\\_{\text{ }}W{\text{ }}\\_
There are 6 blank spaces between the seven white balls .
So , As given no two black balls should be adjacently placed
The total positions where the white balls can be placed are 8.
So , the favourable outcomes are = 8C3
Again applying the formula of combination , we get
Total favourable outcomes = ( 3 ! × 5 ! )8 !
= 56
The required probability =total possible outcomestotal favourable outcomes
Required probability = 12056
Cancelling the terms , we get
Required probability = 157
Hence , the required probability is 157
So, the correct answer is “Option B”.
Note : Corresponding to each combination of nCr we have r! permutations, because r objects in every combination can be rearranged in r! ways . Hence , the total number of permutations of ndifferent things taken r at a time isnCr× r!. ThusnPr = nCr × r! , 0< r ⩽n
Also , some formulas used :
nC1= n
nC2 = 2n(n−1)
nC0 = 1
nCn= 1