06.09.2021 Views

Combinatorics Through Guided Discovery, 2004a

Combinatorics Through Guided Discovery, 2004a

Combinatorics Through Guided Discovery, 2004a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

1.2. Basic Counting Principles 17<br />

In Table 1.2.8 we list all three-element permutations from the 5-element set<br />

{a, b, c, d, e}. Each row consists of all 3-element permutations of some subset<br />

of {a, b, c, d, e}. Because a given k-element subset can be listed as a k-element<br />

permutation in k! ways, there are 3! = 6 permutations in each row. Because each<br />

3-element permutation appears exactly once in the table, each row is a block of a<br />

partition of the set of 3-element permutations of {a, b, c, d, e}. Each block has size<br />

six. Each block consists of all 3-element permutations of some three-element subset<br />

of {a, b, c, d, e}. Since there are ten rows, we see that there are ten 3-element subsets<br />

of {a, b, c, d, e}. An alternate way to see this is to observe that we partitioned the set<br />

of all 60 three-element permutations of {a, b, c, d, e} into some number q of blocks,<br />

each of size six. Thus by the product principle, q · 6=60,soq =10.<br />

• Problem 39. Rather than restricting ourselves to n =5and k =3, we can<br />

partition the set of all k-element permutations of S up into blocks. We do so<br />

by letting B K be the set (block) of all k-element permutations of K for each k-<br />

element subset K of S. Thus as in our preceding example, each block consists<br />

of all permutations of some subset K of our n-element set. For example,<br />

the permutations of {a, b, c} are listed in the first row of Table 1.2.8. In fact<br />

each row of that table is a block. The questions that follow are about the<br />

corresponding partition of the set of k-element permutations of S, where S<br />

and k are arbitrary.<br />

(a) How many permutations are there in a block? (h)<br />

(b) Since S has n elements, what does problem 20 tell you about the total<br />

number of k-element permutations of S?<br />

(c) Describe a bijection between the set of blocks of the partition and the<br />

set of k-element subsets of S. (h)<br />

(d) What formula does this give you for the number ( n )<br />

k<br />

of k-element<br />

subsets of an n-element set? (h)<br />

⇒<br />

Problem 40. A basketball team has 12 players. However, only five players<br />

play at any given time during a game.<br />

(a) In how may ways may the coach choose the five players?<br />

(b) To be more realistic, the five players playing a game normally consist<br />

of two guards, two forwards, and one center. If there are five guards,<br />

four forwards, and three centers on the team, in how many ways can<br />

the coach choose two guards, two forwards, and one center? (h)<br />

(c) What if one of the centers is equally skilled at playing forward? (h)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!