Chapter Summary
Mixed review problems that force a choice among every counting technique in the chapter, with no cue for which one applies.
4 exercises
Exercise 2 (Chapter Review)
For each of the following counting problems, say whether the answer is , , or neither. If you answer is “neither,” say what the answer should be instead.
How many shortest lattice paths are there from to ?
If you have 10 bow ties, and you want to select 4 of them for next week, how many choices do you have?
Suppose you have 10 bow ties and you will wear a different one on each of the next 4 days…
Exercise 4 (Chapter Review)
Give a counting question where the answer is . Give another question where the answer is .
Exercise 15 (Chapter Review)
Explain using lattice paths why .
Exercise 20 (Chapter Review)
For which of the parts of the previous problem (this exercise) does it make sense to interpret the counting question as counting some number of functions? Say what the domain and codomain should be, and whether you are counting all functions, injections, surjections, or something else.
Adapted from Discrete Mathematics: An Open Introduction © 2013–2019 Oscar Levin. Licensed under CC BY-SA 4.0. Source: Discrete Mathematics: An Open Introduction. Imported at revision 1e2e26b.