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.
A store has [latex]8[/latex] cellular phones and that [latex]3[/latex] of those are defective. Find the probability that a couple purchasing [latex]2[/latex] phones receives [latex]2[/latex] phones that are not defective.
To solve this problem, we need to calculate all of the ways to select [latex]2[/latex] phones that are not defective as well as all of the ways to select [latex]2[/latex] phones.
There are [latex]5[/latex] phones that are not defective, so there are [latex]C\left(5,2\right)[/latex] ways to select [latex]2[/latex] phones that are not defective.
There are [latex]8[/latex] phones, so there are [latex]C\left(8,2\right)[/latex] ways to select [latex]2[/latex] phones.
The probability of selecting [latex]2[/latex] phones that are not defective is:
[latex]\begin{align}\dfrac{\text{Number of ways to select 2 phones that are not defective}}{\text{Number of ways to select 2 phones}}&=\dfrac{C\left(5,2\right)}{C\left(8,2\right)} \\[1mm] &=\dfrac{10}{28} \\[1mm] &=\dfrac{5}{14} \end{align}[/latex]
A child randomly selects [latex]5[/latex] toys from a bin containing [latex]3[/latex] bunnies, [latex]5[/latex] dogs, and [latex]6[/latex] bears.
Find the probability that only bears are chosen.
Find the probability that [latex]2[/latex] bears and [latex]3[/latex] dogs are chosen.
Find the probability that at least [latex]2[/latex] dogs are chosen.
We need to count the number of ways to choose only bears and the total number of possible ways to select [latex]5[/latex] toys. There are [latex]6[/latex] bears, so there are [latex]C\left(6,5\right)[/latex] ways to choose [latex]5[/latex] bears. There are [latex]14[/latex] toys, so there are [latex]C\left(14,5\right)[/latex] ways to choose any [latex]5[/latex] toys.
We need to count the number of ways to choose [latex]2[/latex] bears and [latex]3[/latex] dogs and the total number of possible ways to select [latex]5[/latex] toys. There are [latex]6[/latex] bears, so there are [latex]C\left(6,2\right)[/latex] ways to choose 2 bears. There are 5 dogs, so there are [latex]C\left(5,3\right)[/latex] ways to choose 3 dogs. Since we are choosing both bears and dogs at the same time, we will use the Multiplication Principle. There are [latex]C\left(6,2\right)\cdot C\left(5,3\right)[/latex] ways to choose 2 bears and 3 dogs. We can use this result to find the probability.
It is often easiest to solve “at least” problems using the Complement Rule. We will begin by finding the probability that fewer than [latex]2[/latex] dogs are chosen. If less than [latex]2[/latex] dogs are chosen, then either no dogs could be chosen, or [latex]1[/latex] dog could be chosen. When no dogs are chosen, all [latex]5[/latex] toys come from the [latex]9[/latex] toys that are not dogs. There are [latex]C\left(9,5\right)[/latex] ways to choose toys from the [latex]9[/latex] toys that are not dogs. Since there are [latex]14[/latex] toys, there are [latex]C\left(14,5\right)[/latex] ways to choose the [latex]5[/latex] toys from all of the toys.
If there is [latex]1[/latex] dog chosen, then [latex]4[/latex] toys must come from the [latex]9[/latex] toys that are not dogs, and [latex]1[/latex] must come from the [latex]5[/latex] dogs. Since we are choosing both dogs and other toys at the same time, we will use the Multiplication Principle. There are [latex]C\left(5,1\right)\cdot C\left(9,4\right)[/latex] ways to choose [latex]1[/latex] dog and [latex]1[/latex] 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 [latex]2[/latex] dogs are chosen.