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 15<br />

(b) We define a function f from the set of subsets of [n] ={1, 2,...,n} to<br />

the set of functions from [n] to {0, 1} by f (S) =χ S . Explain why f is<br />

a bijection.<br />

(c) Why does the fact that f is a bijection prove that [n] has 2 n subsets?<br />

a The symbol χ is the Greek letter chi that is pronounced Ki, with the i sounding like “eye.”<br />

In Problems 18, Problem 28, and Problem 33 you gave three proofs of the<br />

following theorem.<br />

Theorem 1.2.7. The number of subsets of an n-element set is 2 n .<br />

The proofs in Problem 28 and Problem 33 use essentially the same bijection,<br />

but they interpret sequences of zeros and ones differently, and so end up being<br />

different proofs. We will give yet another proof, using bijections similar to those<br />

we used in proving the Pascal Equation, at the beginning of Chapter 2.<br />

1.2.6 The quotient principle<br />

• Problem 34. As we noted in Problem 29, the first question in Problem 8<br />

asked us for the number of three-element subsets of a twelve-element set.<br />

We were able to use the Pascal Equation to get a numerical answer to that<br />

question. Had we had twenty or thirty flavors of ice cream to choose from,<br />

using the Pascal Equation to get our answer would have entailed a good<br />

bit more work. We have seen how the general product principle gives us<br />

an answer to Problem 6. Thus we might think that the number of ways<br />

to choose a three element set from 12 elements is the number of ways to<br />

choose the first element times the number of ways to choose the second<br />

element times the number of ways to choose the third element, which is<br />

12 · 11 · 10 = 1320. However, our result in Problem 29 shows that this is<br />

wrong.<br />

(a) What is it that is different between the number of ways to stack ice<br />

cream in a triple decker cone with three different flavors of ice cream<br />

and the number of ways to simply choose three different flavors of ice<br />

cream?<br />

(b) In particular, how many different triple decker cones use the same<br />

three flavors? (Of course any three distinct flavors could substitute for<br />

vanilla, chocolate and strawberry without changing the answer.)<br />

(c) Using your answer from part b, compute the number of ways to choose<br />

three different flavors of ice cream (out of twelve flavors) from the<br />

number of ways to choose a triple decker cone with three different<br />

flavors (out of twelve flavors).

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

Saved successfully!

Ooh no, something went wrong!