# Some Examples of Counting Problems

These concepts are much easier to see when you're looking at specific examples. In this section, we'll look at some more complex examples.

## Example 1
This question is similar to ones that we saw in the last section where we treated an empty seat as a "person" for purposes of counting. In this case, we'll treat the group of girls as a single block. If we treat the girls as a single unit then we need to put seven "people" into seven slots. Following the approach we took in the last section, that gives us this arrangement:
If we multiply those numbers together, we get 7 · 6 · 4 · 3 · 2 · 1 = 5,040 possible arrangements. At this point, some of you may be concerned about the group of girls. There are multiple ways that the girls can be seated within their group and we need to take that into consideration. Since there are three girls there are 3 · 2 · 1 = 6 ways that the girls can be arranged within their block. Since the arrangement of the girls and the arrangement of the boys around them on the row are independent of each other, we can apply the Multiplication Principle to conclude that there are a total of 6 · 5040 = 30240 total arrangements. ## Example 3
At first glance this looks like a straightforward example of what we've been doing. Five people can have the first position, four the second and three the third for a total of 5 · 4 · 3 = 60 arrangements. But there's a problem. There is no order within the committee. For example, suppose three of the people are named "Alice", "Bill" and "Cindy". Our counting method counts "Alice", "Bill" and "Cindy" as one arrangement and "Bill", "Alice" and "Cindy" as a different one. Our problem is that both of those arrangements represent the same committee so we don't want to count them separately. The Multiplication Principle will come to our rescue here. Let (number of unordered arrangements) · (number of arrangements within a group) = (number of ordered arrangements) If we substitute our numbers into that equation we get:
So the number of committees (remember that that's our This sort of arrangements where the order doesn't matter is called a "combination". We'll talk more about this in the next section. |
## Example 2
First, let me clarify the question by giving an example. Suppose A = {1, 2, 3, 4, 5}. A subset of A is any combination of the numbers in A without repetition. So, for example, {1, 2, 4}, {1} and {1, 2, 3, 4, 5} would all be subsets of A. For a given subset, the question we nee to ask is, "For each of the five elements in A, is that element in the set or isn't it?" The last part of that sentence is the key: For each of the five numbers, there are exactly two possibilities. Either it's in a given subset or it isn't. So our diagram will have five slots, one for each digit. And for each digit, there are two possibilities.
Multiplying out those numbers gives us 2 ## Example 4
This is a natural extension of Example 2. (It's also a classic question from set theory.) We'll start off with
Just like in Exaple 2, there are 2 possibilities for each slot. Either that element is in the subset or it isn't.
Multiplying those numbers together means multiplying 2 by itself |

Let the members of our potential committee members be "A", "B", "C", "D" and "E".

Here are all the possible arrangements.

{A, B, C} | {A, C, B} | {B, A, C} | {B, C, A} | {C, A, B} | {C, B, A} |

{A, D, C} | {A, C, D} | {D, A, C} | {D, C, A} | {C, A, D} | {C, D, A} |

{A, E, C} | {A, C, E} | {E, A, C} | {E, C, A} | {C, A, E} | {C, E, A} |

{A, B, E} | {A, E, B} | {B, A, E} | {B, E, A} | {E, A, B} | {E, B, A} |

{A, B, D} | {A, D, B} | {B, A, D} | {B, D, A} | {D, A, B} | {D, B, A} |

{A, D, E} | {A, E, D} | {D, A, E} | {D, E, A} | {E, A, D} | {E, D, A} |

{D, B, C} | {D, C, B} | {B, D, C} | {B, C, D} | {C, D, B} | {C, B, D} |

{E, B, C} | {E, C, B} | {B, E, C} | {B, C, E} | {C, E, B} | {C, B, E} |

{C, E, D} | {C, D, E} | {E, C, D} | {E, D, C} | {D, C, E} | {D, E, C} |

{B, E, D} | {B, D, E} | {E, B, D} | {E, D, B} | {D, B, E} | {D, E, B} |

Take a close look at how I laid out the rows. Each one has all of the possible arrangements of the first committee in the row. For example, all of the "committees" on the first row are the same since they all consist of A, B and C. Similarly, all the committees on the second row are made up of A, D and C, etc. So, to get the answer to our question, we need to take the 60 arrangements in the whole grid and reduce them down to the number of rows in the grid. To do this you would divide the number of cells (60) by the number of columns (6). But notice that the number of columns is equal to the number of ways that the 3 elements in the column can be rearranged.