Combinatorics Through Guided Discovery, 2004a
Combinatorics Through Guided Discovery, 2004a
Combinatorics Through Guided Discovery, 2004a
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
8 1. What is <strong>Combinatorics</strong>?<br />
+ Problem 16. How does the general product principle apply to Problem 6?<br />
• Problem 17. In how many ways can we pass out k distinct pieces of fruit to<br />
n children (with no restriction on how many pieces of fruit a child may get)?<br />
• Problem 18. How many subsets does a set S with n elements have? (h)<br />
◦ Problem 19. Assuming k ≤ n, in how many ways can we pass out k distinct<br />
pieces of fruit to n children if each child may get at most one? What is the<br />
number if k > n? Assume for both questions that we pass out all the fruit. (h)<br />
• Problem 20. Another name for a list, in a specific order, of k distinct things<br />
chosen from a set S is a k-element permutation of S. We can also think of<br />
a k-element permutation of S as a one-to-one function (or, in other words,<br />
injection) from [k] ={1, 2,...,k} to S. How many k-element permutations<br />
does an n-element set have? (For this problem it is natural to assume k ≤ n.<br />
However the question makes sense even if k > n. What is the number of<br />
k-element permutations of an n-element set if k > n? (h)<br />
There are a number of different notations for the number of k-element permutations<br />
of an n-element set. The one we shall use was introduced by Don Knuth;<br />
namely n k , read “n to the k falling” or “n to the k down”. In Problem 20 you may<br />
have shown that<br />
k∏<br />
n k = n(n − 1) ···(n − k +1)= (n − i +1). (1.1)<br />
It is standard to call n k the k-th falling factorial power of n, which explains<br />
why we use exponential notation. Of course we call it a factorial power since n n =<br />
n(n − 1) ···1 which we call n-factorial and denote by n!. If you are unfamiliar with<br />
the Π notation, or product notation we introduced for products in Equation (1.1),<br />
it works just like the Σ notation works for summations.<br />
i=1<br />
• Problem 21. Express n k as a quotient of factorials.<br />
⇒ Problem 22. How should we define n 0 ?