<< Chapter < Page | Chapter >> Page > |
There are 32 possible pizzas. This result is equal to $\text{\hspace{0.17em}}{2}^{5}.\text{\hspace{0.17em}}$
We are presented with a sequence of choices. For each of the $n$ objects we have two choices: include it in the subset or not. So for the whole subset we have made $n\text{\hspace{0.17em}}$ choices, each with two options. So there are a total of $2\xb72\xb72\xb7\dots \xb72$ possible resulting subsets, all the way from the empty subset, which we obtain when we say “no” each time, to the original set itself, which we obtain when we say “yes” each time.
A set containing n distinct objects has ${2}^{n}$ subsets.
A restaurant offers butter, cheese, chives, and sour cream as toppings for a baked potato. How many different ways are there to order a potato?
We are looking for the number of subsets of a set with 4 objects. Substitute $n=4$ into the formula.
There are 16 possible ways to order a potato.
A sundae bar at a wedding has 6 toppings to choose from. Any number of toppings can be chosen. How many different sundaes are possible?
64 sundaes
We have studied permutations where all of the objects involved were distinct. What happens if some of the objects are indistinguishable? For example, suppose there is a sheet of 12 stickers. If all of the stickers were distinct, there would be $12!$ ways to order the stickers. However, 4 of the stickers are identical stars, and 3 are identical moons. Because all of the objects are not distinct, many of the $12!$ permutations we counted are duplicates. The general formula for this situation is as follows.
In this example, we need to divide by the number of ways to order the 4 stars and the ways to order the 3 moons to find the number of unique permutations of the stickers. There are $4!$ ways to order the stars and $3!$ ways to order the moon.
There are 3,326,400 ways to order the sheet of stickers.
If there are $n$ elements in a set and ${r}_{1}\text{\hspace{0.17em}}$ are alike, $\text{\hspace{0.17em}}{r}_{2}\text{\hspace{0.17em}}$ are alike, ${r}_{3}\text{\hspace{0.17em}}$ are alike, and so on through ${r}_{k},\text{\hspace{0.17em}}$ the number of permutations can be found by
Find the number of rearrangements of the letters in the word DISTINCT.
There are 8 letters. Both I and T are repeated 2 times. Substitute $\text{\hspace{0.17em}}n=8,{r}_{1}=2,\text{\hspace{0.17em}}$ and $\text{\hspace{0.17em}}{r}_{2}=2\text{\hspace{0.17em}}$ into the formula.
There are 10,080 arrangements.
Find the number of rearrangements of the letters in the word CARRIER.
840
Access these online resources for additional instruction and practice with combinations and permutations.
number of permutations of $\text{\hspace{0.17em}}n\text{\hspace{0.17em}}$ distinct objects taken $\text{\hspace{0.17em}}r\text{\hspace{0.17em}}$ at a time | $$P(n,r)=\frac{n!}{(n-r)!}$$ |
number of combinations of $\text{\hspace{0.17em}}n\text{\hspace{0.17em}}$ distinct objects taken $\text{\hspace{0.17em}}r\text{\hspace{0.17em}}$ at a time | $$C(n,r)=\frac{n!}{r!(n-r)!}$$ |
number of permutations of $\text{\hspace{0.17em}}n\text{\hspace{0.17em}}$ non-distinct objects | $$\frac{n!}{{r}_{1}!{r}_{2}!\dots {r}_{k}!}$$ |
Notification Switch
Would you like to follow the 'College algebra' conversation and receive update notifications?