CS 3653: Discrete Mathematics
Fall 2009
Homework 8 (Version 1): Introductory Combinatorics
Due Date: December 1 (Tuesday), 2009
----------------------------------------------------

Notes:

• Read Course Information: Section 7 (Miscellaneous) and Section 9 (Academic Dishonesty or Misconduct).
• When you are giving a construction, example, etc., provide a justification with your argument. Your solutions to numerical problems must contain the derivation of your answers. In all of your presentations, strive for correctness, completeness, and clarity. When in doubt about the assumptions of problems, the interpretations of wording, etc., consult the instructor.
• You should strive to complete all problems assigned, and a subset of them will be graded.

1. Read the notes above carefully.
2. For each computational problem below, briefly explain how you obtain your answers. Do [Ros07] Section 5.1, exercises 16, 22, 24, 26, 28, 30, 36 c) and d), 38, 40, 42, 46, 48, and 54.
3. Note: More problems may be given in next version.

---

File translated from T_EX by T_TH, version 3.85.
On 19 Nov 2009, 11:52.