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.

170 D. Hints to Selected Problems<br />

15. In how many ways may you assign the men to their rows? The women? Once<br />

a woman and a man have a row to share, in how many ways may they choose<br />

their seats?<br />

18. Try applying the product principle in the case n =2and n =3. How might<br />

you apply it in general?<br />

19. Ask yourself if either the sum principle or product principle applies.<br />

Additional Hint: Remember that zero is a number.<br />

20. Do you see an analogy between this problem and any of the previous problems?<br />

26.a. For each part of this problem, think about how many arrows are allowed to<br />

enter a vertex representing a member of Y.<br />

28. The problem is asking you to describe a one-to-one function from the set of<br />

binary representations of numbers between 0 and 2 n −1 onto the set of subsets<br />

of the set [n]. Write down these two sets for n =2. They should both have<br />

four elements. The set of binary representations should contain the string 00.<br />

You could think of this as the instruction “take no ones and take no twos.”<br />

In that context, what could you think of the string 11 as standing for? This<br />

should help you describe a function. Of course now you have to figure out<br />

how to show it is one-to-one and onto.<br />

31. Starting with the row 1 8 28 56 70 56 28 8 1, put dots below it where the<br />

elements of row 9 should be. Then put dots below that where the elements<br />

of row 10 should be. Do the same for rows 11 and 12. Mark the dot where<br />

row 12 should appear. Now mark the dots you need in row 11 to compute<br />

the entry in column 3 of row 12. Now mark the dots you need in row 10 to<br />

compute the marked entries in row 11. Do the same for rows 9 and 8. Now<br />

you should be able to see what you need to do.<br />

32.a. Begin by trying to figure out what the entries just above the diagonal of the<br />

rectangle are. After that, what other entries can you figure out?<br />

32.b. See if you can figure out what the entries in column −1 have to be.<br />

32.c. What does the sum of two consecutive values in row −1 have to be? Could<br />

this sum depend on which two consecutive values we take? Is there some<br />

value of row −1 that we could choose arbitrarily? Now what about row −2?<br />

Can we make arbitrary choices there? If so, how many can we make, and is<br />

their position arbitrary?<br />

36. The first thing you need to decide is “What are the two sets whose elements<br />

we are counting?” Then it will be easier to think of a bijection between these<br />

two sets. It turns out that these two sets are sets of sets!

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

Saved successfully!

Ooh no, something went wrong!