| << Chapter < Page | Chapter >> Page > |
Two number cubes are rolled. Use the Complement Rule to find the probability that the sum is less than 10.
Many interesting probability problems involve counting principles, permutations, and combinations. In these problems, we will use permutations and combinations to find the number of elements in events and sample spaces. These problems can be complicated, but they can be made easier by breaking them down into smaller counting problems.
Assume, for example, that a store has 8 cellular phones and that 3 of those are defective. We might want to find the probability that a couple purchasing 2 phones receives 2 phones that are not defective. To solve this problem, we need to calculate all of the ways to select 2 phones that are not defective as well as all of the ways to select 2 phones. There are 5 phones that are not defective, so there are ways to select 2 phones that are not defective. There are 8 phones, so there are ways to select 2 phones. The probability of selecting 2 phones that are not defective is:
A child randomly selects 5 toys from a bin containing 3 bunnies, 5 dogs, and 6 bears.
When no dogs are chosen, all 5 toys come from the 9 toys that are not dogs. There are ways to choose toys from the 9 toys that are not dogs. Since there are 14 toys, there are ways to choose the 5 toys from all of the toys.
If there is 1 dog chosen, then 4 toys must come from the 9 toys that are not dogs, and 1 must come from the 5 dogs. Since we are choosing both dogs and other toys at the same time, we will use the Multiplication Principle. There are ways to choose 1 dog and 1 other toy.
Because these events would not occur together and are therefore mutually exclusive, we add the probabilities to find the probability that fewer than 2 dogs are chosen.
We then subtract that probability from 1 to find the probability that at least 2 dogs are chosen.
Notification Switch
Would you like to follow the 'Algebra and trigonometry' conversation and receive update notifications?
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|