MHB Probability of identifying both defective fuses in four or less tests

boosewell
Messages
2
Reaction score
0
This question is driving me crazy.

According to the textbook, the answer is 7/15, but I get 2/5. If anyone can tell me where I am going wrong I would be much obliged

Here is the question

Six fuses, of which two are defective and four are good, are to be tested one after another in random order until both defective fuses are identified.
Find the probability that the number of fuses that will be tested is four or less.

And this is my answer

Assuming two fuses need to be tested, the combination should be

Bad – bad = 2/6 x 1/5 = 2/30 = 1/15
Assuming three fuses need to be tested, the combinations should be
Bad – good – bad = 2/6 x 4/5 x 1 /4 = 8/120 =2/30 = 1/15
Good - bad – bad = 4/6 x 2/5 x 1 /4 = 8/120 =2/30 = 1/15

Assuming four fuses need to be tested, the combinations should be
Bad – good -good – bad = 2/6 x 4/5 x 3 /4 x 1/3 =24/360 = 1/15
Good - bad -good – bad = 4/6 x2/5 x 3 /4 x 1/3 =24/360 = 1/15
Good - good -bad – bad = 4/6 x3/5 x2 /4 x 1/3 =24/360 = 1/15

1/15 + 1/15 + 1/15 + 1/15 + 1/15 + 1/15 = 6/15

And I know that it is wrong because the textbook says so, but I can't think why.

Any help would be greatly appreciated.
 
Mathematics news on Phys.org
Re: Discrete ramdom variables

Hi boosewell,

Welcome to MHB! Glad you found us! Please let me know if you have any questions.

Your calculations look good, but maybe incomplete. What about the case of testing 3 fuses? :)
 
Re: Discrete ramdom variables

We could take another approach, and use the complement's rule. This way we need only consider two case: that it takes 5 tests or it takes 6 tests.

In order for it to take 6 tests, we would need to have 2 groups of fuses...the first group would consist of 5 fuses with one bad among them, and the second group would contain 1 bad fuse. How many ways can we arrange the fuses like this? We'll call this $N_6$.

In order for it to take 5 tests, we would need to have 3 groups of fuses...the first group would have 3 good and 1 bad, the second group would have 1 bad, and the third group would have 1 good. How many ways can we arrange the fuses like this? We'll call this $N_5$.

Then we consider how many total ways there are to arrange the 6 fuses. We'll call this $N$.

Then we can use the complement's rule...we know it is certain it will either take 4 or fewer tests or it will take more than 4 tests...and so we may state:

$$P(X\le4)+\frac{N_5+N_6}{N}=1$$

Hence:

$$P(X\le4)=1-\frac{N_5+N_6}{N}$$

Correctly calculating $N_5,\,N_6,\,N$ will yield:

$$P(X\le4)=\frac{7}{15}$$

I wanted to leave calculating those values for you to try first. :)
 
Re: Discrete ramdom variables

Bingo !

Thanks MarkFL

and, because my earlier thank you post appears to have gone astray, thanks as well to Jameson.

I think that I am going to enjoy this site.
 
Re: Discrete ramdom variables

Doh. Well my reading comprehension could use some work because you wrote about the 3 fuse case in your post. I missed it in between the lines breaks. MarkFL's way definitely works but so should your way. Let me see where the error is. You definitely have the right idea, so it's something small...
 
Thanks to the help of I like Serena, here is what we missed.

There is also the 4 case of GGGG. If you identify all 4 good fuses, then the remaining 2 must be bad. The probability of this is $\frac{4}{6}\frac{3}{5}\frac{2}{4}\frac{1}{3}=\frac{1}{15}$. Now the answer adds up to 7/15 as the book indicates. :)
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top