Permutations, presented in Section SubsectionΒ 1.5.1, count the number of ways to permute, or rearrange, objects. Note that when permuting objects, some can be ignored. For example TableΒ 3.4.1 are all permutations of two characters from the alphabet \(\{a,b,c\}.\)
Sometimes the order of objects is unimportant. The number of outcomes can still be counted. These are called combinations. The combinations of two letters from the alphabet \(\{a,b,c\}.\) are ab, ac, bc.
How many permutations of two letters from the alphabet \(\{a,b,c\}.\) are there? How many combinations of two letters from the alphabet \(\{a,b,c\}.\) are there? How do you get the combinations count from the permutations count?
How many permutations are there of three letters from the alphabet \(\{a,b,c,d\}\text{?}\) Select three of these letters. How many ways can you order these three letters? How does this help count the number of combinations of three letters from this alphabet?
If the first problem counted the number of ways to order three (3) of ten (10) people and the second problem counted the number of ways any particular three can be ordered, how can these be combined to count the number of ways to select three (3) out of ten (10) people?