583 views

2 Answers

Best answer
3 votes
3 votes

Total case possible for throwing 3 dice independently $= 6*6*6 = 216.$

-------------------------------------------------------------------------------------------------------------

Favorable cases :

 $(6,2)$ and $(1,5)$ are only possible pairs that give 4 as the difference.

Cases with (6,2) possible are

$(6,6,2)$ and these can be arranged in $\frac{3!}{2!}$ ways = 3 ways

$(6,5,2)$ and these can be arranged in $3!$ ways = 6 ways

$(6,4,2)$ and these can be arranged in $3!$ ways = 6 ways

$(6,3,2)$ and these can be arranged in $3!$ ways = 6 ways

$(6,2,2)$ and these can be arranged in $\frac{3!}{2!}$ ways = 3 ways

$\therefore$ 3+6+6+6+3 = $24$ cases possible

Cases with (5,1) possible are

$(5,5,1)$ and these can be arranged in $\frac{3!}{2!}$ ways = 3 ways

$(5,4,1)$ and these can be arranged in $3!$ ways = 6 ways

$(5,3,1)$ and these can be arranged in $3!$ ways = 6 ways

$(5,2,1)$ and these can be arranged in $3!$ ways = 6 ways

$(5,1,1)$ and these can be arranged in $\frac{3!}{2!}$ ways = 3 ways

$\therefore$ 3+6+6+6+3 = $24$ cases possible

$\therefore$ Total number of favorable cases = 24 + 24 = $48$

----------------------------------------------------------------------------------------------------------

$\therefore$ Required Probability = $\frac{Total number of favorable cases}{Total number of cases}$ = $\frac{48}{216}$ = $0.22$

selected by
4 votes
4 votes

Sample space be $S = \{(d_1, d_2, d_3) \ | \ 1 \le d_1,d_2,d_3 \le 6\}$ where $d_i$ correspond to $i^{th}$ dice. 

$\underline{\textbf{Case 1:}} \text{ }$ 

$\forall_{1 \le j,k,z \le 3} \ j\neq k \land  d_j=1 \land d_k=5 \land z \neq j \land z \neq k\Longrightarrow \forall_{2\le m\le 4} \ d_z = m$

In other way, we write it as $\underbrace{^3C_2}_{\text{selecting j, k}} \times \underbrace{2!}_{\text{arranging j,k}} \times \underbrace{^3C_1}_{\text{choosing }d_z} = 18$

And,

$\forall_{1 \le j,k,z \le 3} \ j\neq k \land  d_j=2 \land d_k=6 \land z \neq j \land z \neq k\Longrightarrow \forall_{3\le m\le 5} \ d_z = m$

In other way, we write it as $\underbrace{^3C_2}_{\text{selecting j, k}} \times \underbrace{2!}_{\text{arranging j,k}} \times \underbrace{^3C_1}_{\text{choosing }d_z} = 18$

$\underline{\textbf{Case 2:}}$

$\forall_{1 \le j,k,z \le 3} \ j\neq k \land  d_j=1 \land d_k=5 \land z \neq j \land z \neq k\Longrightarrow \forall_{m \in \{1,5\}} \ d_z = m$

In other way, we write it as $\dfrac{\underbrace{^3C_2}_{\text{selecting j, k}} \times \underbrace{2!}_{\text{arranging j,k}} \times \underbrace{^2C_1}_{\text{choosing }d_z}}{\underbrace{2!}_{\text{overcounting; e.g. (1,1,5) counted twice}}} = 6$

And, 

$\forall_{1 \le j,k,z \le 3} \ j\neq k \land  d_j=2 \land d_k=6 \land z \neq j \land z \neq k\Longrightarrow \forall_{m \in \{2,6\}} \ d_z = m$

In other way, we write it as $\dfrac{\underbrace{^3C_2}_{\text{selecting j, k}} \times \underbrace{2!}_{\text{arranging j,k}} \times \underbrace{^2C_1}_{\text{choosing }d_z}}{\underbrace{2!}_{\text{overcounting; e.g. (2,2,6) counted twice}}} = 6$

$\underline{\textbf{Total}}$

$\text{Favourable Cases} = 18+18+6+6 = 48$

$|S| = 6^3 = 216$

$\text{Probability} = \dfrac{48}{216} = 0.\overline{2}$

Related questions

756
views
1 answers
1 votes
sripo asked Feb 15, 2019
756 views
If a fair die (with 6 faces) is cast twice, what is the probability that the twonumbers obtained differ by 2?(A) 1/12(B) 1/6(C) 2/9(D) 1/2
391
views
0 answers
1 votes
sripo asked Feb 15, 2019
391 views
Two gamblers have an argument. The first one claims that if a fair coin is tossedrepeatedly, getting two consecutive heads is very unlikely. The second, naturally, ... ? Is it true that P (n) only increases with n? Justifyyour answer.
577
views
0 answers
2 votes
Sayan Bose asked Feb 18, 2019
577 views
A directed graph with n vertices, in which each vertex has exactly 3 outgoing edges. Which one is true?A) All the vertices have indegree = 3 .B) Some ... )Some vertices have indegree atleast 3.D) Some of the vertices have indegree atmost 3
552
views
0 answers
2 votes
vivek_mishra asked Feb 17, 2019
552 views
Let ${(0,1)}^n$ set of all binary string of length n. Hamming sphere of radius around a string C in ${(0,1)}^n$ is the set of all strings d$\epsilon$ ... S(C,k) and S(C',k) are disjointcouldn't remember rest of the options.