06.09.2021 Views

Combinatorics Through Guided Discovery, 2004a

Combinatorics Through Guided Discovery, 2004a

Combinatorics Through Guided Discovery, 2004a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Appendix D<br />

Hints to Selected Problems<br />

1. Answer the questions in Problem 2 for the case of five schools.<br />

3. For each kind of bread, how many sandwiches are possible?<br />

6. Try to solve the problem first with a two-scoop cone. (Look for an earlier<br />

problem that is analogous.) Then, for each two scoop cone, in how many<br />

ways can you put on a top scoop?<br />

7.a. Ask yourself “how many choices do we have for f (1)?” Then ask how many<br />

choices we have for f (2).<br />

7.b. It may not be practical to write down rules for all the functions for this<br />

problem. But you could ask yourself how many choices we have for f (1),<br />

howmanywehavefor f (2) and how many we have for f (3).<br />

7.c. If you are choosing a function f , how many choices do you have for f (a)?<br />

Then how many choices do you have for f (b)?<br />

8.a. You know how to figure out in how many ways they could make a list of<br />

three flavors out of the twelve. But each set of three flavors can be listed in a<br />

number of different ways. Try to figure out in how many ways a set of three<br />

flavors can be listed, and then try to see how this helps you.<br />

8.b. Try to break the problem up into cases you can solve by previous methods;<br />

then figure out how to get the answer to the problem by using these answers<br />

for the cases.<br />

12.a. Suppose you have a list in alphabetical order of names of the members of the<br />

club. In how many ways can you pair up the first person on the list? In how<br />

many ways can you pair up the next person who isn’t already paired up?<br />

169

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

Saved successfully!

Ooh no, something went wrong!