Math 2000 - Solutions 12
Fall 2001
Unit 7E
4. This is arrangement with repetition, and so we have
different ten-note tunes using the 7 available notes.
6. This is arrangement with repetition, and so we have
different three-number combinations using the
available 30 numbers.
8. This is a permutation, and so we have
different
ways to schedule the 12 acts.
12. This is a combination, as we are only interested in the makeup
of the hand, order plays no role. So we have
, which
comes out to 270,725, different four-card hands, using the
fifty-two available cards.
14. This is a permutation, and so we have
different five-card sequences,
using the fifty-two available cards.
21. This is combination problem, as we are only interested in the
makeup of the pizza, order plays no role. If Luigi uses
different pizza toppings, then we have
different
three-topping pizzas. We wish to know
: some trial and error
leads to the discovery that
.
Similarly, if Ramona uses
different pizza toppings, then we
have
different two-topping pizzas. We wish to know
: some trial and error leads to the discovery that
.
Lotteries
We have seen that lottery problems involve combinations. In the
first lottery, there are
different
arrangements of the numbers, which means the probability of
matching one of those numbers with one ticket is
. For the second lottery, there are
different arrangements of the numbers,
which means the probability of matching one of those numbers with
one ticket is
. For the third
lottery, there are
different arrangements
of the numbers, which means the probability of matching one of
those numbers with one ticket is
. We see that the first lottery has the
greatest probability of winning because it has the fewest number
of outcomes.