3 1 . The circuit will work, if there is a closed path from the left to the right.
In the above circuit, the switches operate independently of each other. Each switch is closed with probabilityWhat is the probability that the circuit is working?
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.
Find in few seconds by deduction : top and bottom left sides are 1 / 3 * 1 / 3 = 1 / 9 chance to be closed. So the 2 together it's close-lower-than 2 * 1 / 9. And with the right side (1/3 chance to be close) it's ~ 2 / 9 * 1 / 3 so the answer is close -lower-than 2 / 27.
Woah I just came up with a formula for adding up probabilities in parallel!
So we all know that if we had two of those switches in series (each with a probability of being closed of 3 1 ), then the probability of both being closed is 9 1 . To show this graphically, we can model it the probabilities with X 's and O 's.
X O O = 3 1
X O O = 3 1
Total probability = 9 1
By drawing a little arrow connecting two symbols (either an X or an O ), and doing that for each possible combination, you can just count the number of connections you made that have two X's , divide that by the total number of connections you made, and that will give you the probability that both of the switches in series will be closed.
The only difference you make to find out the probability of switches in parallel (as they are in this problem) is, after doing the whole drawing of X 's and O 's, you count the number of connections you made that have even one X in them . Think about that if the underlying logic seems unclear.
After toying with that self-made illustration that I made, I started to see what 'net' probabilities I would get for various combinations of two different probabilities in parallel. To my surprise, I came up with this mathematical description.
Let P 1 be the probability of the first 'switch' in parallel being closed, and P 2 be the probability for the second. The net probability, P n e t (the probability that either or both will be closed), is:
P 1 + P 2 − ( P 1 × P 2 ) = P n e t
Applying this to the original problem, we start off by reducing the two switch probabilities in each of the pathways to
3 1 × 3 1 = 9 1 .
Then, using the formula that I just wrote down, we get the 'net' probability of either pathway being closed:
9 1 + 9 1 − ( 2 7 1 ) = 8 1 1 7
Finally, we just do another probability in series for the last switch on the right:
8 1 1 7 × 3 1 = 2 4 3 1 7
For the path to work we need three switches on in a row. The probability of this is 1/27. This can happen two ways, depending whether you go across the top or bottom. However, this has included one possibility - all five switches being closed - twice. The probability of this is 1/243 so the total probability is 2/27 - 1/243 = 17/243
Can we solve this prob by mathematical logic method
Log in to reply
Yes of course, that's how I solved it.
However, it's much cooler to solve the problem and come up with a very useful equation that will allow you to get through a whole spectrum of problems using your mathematical logic.
Problem Loading...
Note Loading...
Set Loading...
From the diagram, we see that there are two paths from left to right and both of these paths have three switches. The probability of one path working is 2 7 1 , while the probability of both paths working is 2 4 3 1 . By the Principle of Inclusion-Exclusion, the total probability is thus 2 7 1 + 2 7 1 − 2 4 3 1 = 2 4 3 1 7 .