Professional Documents
Culture Documents
HW1 Solution
HW1 Solution
(i) 5 points are given for completion and 5 points are given for correctness, per each
question;
(ii) For a total of 8/8 problems graded, the maximum possible score is 80, if all questions
are completed and done correctly
Required Questions
For questions about combinatorial analysis, some numbers in the solutions mean the number
of possible choices for certain experiments/steps.
Chapter 1.
Problems 1 Solution:
(a) First 2 places: 262 . The other 5 places: 105 . In total: 262 × 105
Problems 2 Solution:
By generlized basic principle of counting, the answer is 64 .
Problems 8 Solution:
(a) Since ”Fluke” has five unique letters we have 5! = 120 possible arrangements.
1
(b) Since ”Propose” has seven letters of which four (the ”o”’s and the ”p”’s) repeat we have
7!
2!×2!
= 1260 possible arrangements.
(c) ”Mississippi” has eleven characters with the ”i” repeated four times, the ”s” repeated
11!
four times, and the ”p” repeated two times, so we have 4!×4!×2! possible arrangements.
7!
(d) ”Arrange” has seven characters with a double ”A” and a double ”r” so it has 2!×2!
possible arrangements.
Problems 20 Solution:
(a) There are a total of 85 possible groups of friends that could attend (assuming no feuds).
possible groups of friends. Alternative Solution: The possible outcomes that only
one of the feuding people attend is 22 × 64 and the possible outcomes that none of the
(b) If none of the two people attend, the number of possible groups is 65 . If they attendto-
choices. Alternative Solution: There are a total of 85 possible groups of friends that
could attend (assuming no feuds). The possible outcomes that the second person of the
pair attend is 64 and the possible outcomes that the second person of the pair attend
Problems 24 Solution:
5 5
2 2 5
X 5 2 k 2 5−k
X 5 k 2l 2(5−k)
(3x + y ) = (3x ) (y ) = 3 x y
k=0
k k=0
k
Theoretical Exercise 5 Solution: To have the sum evaluate to exactly k, we must select
at k components from the vector x to have the value one. Since there are n components
in the vector x, this can be done in nk ways. To have the sum exactly equal k + 1 we
n
must select k + 1 components from x to have a value one. This can be done in k+1 ways.
Continuing this pattern we see that the number of binary vectors x that satisfy
n
X
xi ≥ k
i
2
is given by
n
X n n n n n
= + + ··· + +
l=k
l n n−1 k+1 k