Counting Techniques - Welcome to Ohio University欢迎来到俄亥俄大学计数技术.pptVIP

Counting Techniques:Combinations Combinations Typical situation: How many 5-card hands can be made from a deck of 52 cards? Definition: r-combination of a set of n elements is a subset of r of the n elements. The number of all r-combinations of a set of n elements denoted and read “n choose r”. In the example above, want to find C52,5 . Unordered versus ordered selections Two ordered selections are the same if ? the elements chosen are the same; ? the elements chosen are in the same order. Ordered selections correspond to r-permutations. The number of all r-permutations is P(n,r) . Two unordered selections are the same if ? the elements chosen are the same. (regardless of the order in which the elements are chosen) Unordered selections correspond to r-combinations. The number of all r-combinations is C(n,r) . Formula for computing C(n,r) Suppose we want to compute P(n,r) . Constructing an r-permutation from a set of n elements can be thought as a 2-step process: Step 1: Choose a subset of r elements; Step 2: Choose an ordering of the r-element subset. Step 1 can be done in C(n,r) different ways. Step 2 can be done in r! different ways. (regardless of how the step 1 was performed) Based on the multiplication rule, P(n,r) = C(n, r) ? r! Thus, Examples on Combinations The number of different 5-card hands from a deck of 52 cards: 4 members from a group of 11 are supposed to work as a team on a project. Q: How many distinct 4-person teams can be chosen? A: Examples on Combinations Suppose in the project example, Mary might work on the project only if John is also involved in the project. Q: What is the number of 4-people teams that can be chosen from 11 people in this case? Solution: Divide the set S of all possible teams into two subsets. Let X be the set of teams with Mary; Y be the set of teams without Mary. ? If Mary is in the team, then John is also there. The remaini