<< Chapter < Page | Chapter >> Page > |
In a town, the attendance at a football game depends on the weather. On a sunny day the attendance is 60,000, on a cold day the attendance is 40,000, and on a stormy day the attendance is 30,000. If for the next football season, the weatherman has predicted that 30% of the days will be sunny, 50% of the days will be cold, and 20% days will be stormy, what is the expected attendance for a single game?
Using the expected value formula, we get
A lottery consists of choosing 6 numbers from a total of 51 numbers. The person who matches all six numbers wins $2 million. If the lottery ticket costs $1, what is the expected payoff?
Since there are combinations of six numbers from a total of 51 numbers, the chance of choosing the winning number is 1 out of 18,009,460. So the expected payoff is
This means that every time a person spends $1 to buy a ticket, he or she can expect to lose 89 cents.
As we have already seen, tree diagrams play an important role in solving probability problems. A tree diagram helps us not only visualize, but also list all possible outcomes in a systematic fashion. Furthermore, when we list various outcomes of an experiment and their corresponding probabilities on a tree diagram, we gain a better understanding of when probabilities are multiplied and when they are added. The meanings of the words and and or become clear when we learn to multiply probabilities horizontally across branches, and add probabilities vertically down the tree.
Although tree diagrams are not practical in situations where the possible outcomes become large, they are a significant tool in breaking the problem down in a schematic way. We consider some examples that may seem difficult at first, but with the help of a tree diagram, they can easily be solved.
A person has four keys and only one key fits to the lock of a door. What is the probability that the locked door can be unlocked in at most three tries?
Let be the event that the door has been unlocked and be the event that the door has not been unlocked. We illustrate with a tree diagram.
Therefore,
A jar contains 3 black and 2 white marbles. We continue to draw marbles one at a time until two black marbles are drawn. If a white marble is drawn, the outcome is recorded and the marble is put back in the jar before drawing the next marble. What is the probability that we will get exactly two black marbles in at most three tries?
We illustrate using a tree diagram.
The probability that we will get two black marbles in the first two tries is listed adjacent to the lowest branch, and it
The probability of getting first black, second white, and third black
Similarly, the probability of getting first white, second black, and third black
Therefore, the probability of getting exactly two black marbles in at most three tries
A circuit consists of three resistors: resistor , resistor , and resistor , joined in a series. If one of the resistors fails, the circuit stops working. If the probability that resistors , , or will fail is , , and , respectively, what is the probability that at least one of the resistors will fail?
Clearly, .
It is quite easy to find the probability of the event that none of the resistors fails. We don't even need to draw a tree because we can visualize the only branch of the tree that assures this outcome.
The probabilities that , , will not fail are , , and respectively. Therefore, .
Thus, .
Notification Switch
Would you like to follow the 'Applied finite mathematics' conversation and receive update notifications?