Homework #2, Due Feb 2: at the beginning of class.
All problems are from the book. Solution sets must be correct, legible, and complete for full marks.

Chapter 3: 1, 9, 10, 23, 41.

Find a formula for the number of ordered forests with n nodes and k trees. Prove that your formula is correct in three ways: using the cycle lemma and the shepherd principle, using generating functions, and using the reflection principle.