548 views
1 votes
1 votes
In a bunch of 13 T-shirts only one is of Medium size, which is correct fit for the searching person. Each time wrong size is picked, the person throws it away and pick the next T-shirt. What is the probability that the correct size T-shirt can be searched in 8th attempt ?

1 Answer

3 votes
3 votes
you have 13 T-shirts in which 12 are not matching and 1 is matching.

 

at first attempt, you have to take non-matching t-shirt, probability = $\frac{12}{13}$

in second attempt, you have to take non-matching t-shirt, probability = $\frac{11}{12}$ ( due to you have 12 t-shirts only available with you )

in third attempt, you have to take non-matching t-shirt, probability = $\frac{10}{11}$ ( due to you have 11 t-shirts only available with you )

in fourth attempt, you have to take non-matching t-shirt, probability = $\frac{9}{10}$ ( due to you have 10 t-shirts only available with you )

in fifth attempt, you have to take non-matching t-shirt, probability = $\frac{8}{9}$ ( due to you have 9 t-shirts only available with you )

in sixth attempt, you have to take non-matching t-shirt, probability = $\frac{7}{8}$ ( due to you have 8 t-shirts only available with you )

in seventh attempt, you have to take non-matching t-shirt, probability = $\frac{6}{7}$ ( due to you have 7 t-shirts only available with you )

in eighth attempt, you have to take matching t-shirt, probability = $\frac{1}{6}$ ( due to you have 6 t-shirts only available with you )

Therefore total probability = $ \frac{12 * 11 * 10 * 9 * 8 * 7 * 6 * 1}{ 13 * 12 * 11 * 10 * 9 * 8 * 7 * 6 }$ = $ \frac{1}{ 13 }$

Related questions

3.8k
views
3 answers
4 votes
Hirak asked Jun 9, 2019
3,751 views
If Kruskal's algorithm is used for finding a minimum spanning tree of a weighted graph G with n vertices and m edges and edge weights are already given in a sorted list, ... operations take amortized O(1) ? AO(m logn)BO(n)CO(m)DO(n logm)
1.8k
views
0 answers
1 votes
Ashish Roy 1 asked Mar 16, 2019
1,753 views
In the above 4 Statements which would print 123 as output ? Explain also.
2.2k
views
2 answers
4 votes
Prince Sindhiya asked Dec 27, 2018
2,184 views
In the Lexical Analysis, regular expression can be used to modelA) the structures of lexemes with fixed length identifier excludedB) the structure of ... but not lexemesD) the structure of lexemes with variable length identifier included
609
views
1 answers
0 votes
Gupta731 asked Nov 1, 2018
609 views
Consider the statements about decomposition of a relation R is decomposed into R1, R2, R3, R4, .... Rn with functional dependencies F1, F2, F3, ..., Fn of functional ... .... Rn ≡ R and F1∪F2∪F3∪ ...∪Fn ⊃ F respectivelyD. None of the above