AMS 301 Spring 2010 HW #8

Chao Xu(106978083)
5.3.12
Suppose there is no pink, lavender, tan ball. There are 8+3−1 = 10



8 8 Suppose there is one pink or lavender
or tan ball. There are 31 7+3−1 = 3 97 Suppose there are two out of pink, lavender or tan ball. There are




7
3 6+3−1
= 3 6 . Suppose there contain all of pink, lavender or tan ball. There are 33 5+3−1
8
= 75 Total







2 6 5
is 10 9 8 7





8 + 3 7 + 3 6 + 5 = 258.

5.3.16
Let’s consider number start with 0 is also considered 9 digits. Two cases:
Case 1: 4 distinct odd digit and 2 distinct even digit
5

5
9!
Let the ith distinct digit occur kn times, then we have 4 2 k1 !k2 !k3 !k4 !k5 !k6 ! . Where ki ≥ 1 and
P6
i=1 ki = 9.

There can be 1 digit occuring 4 times, 2 digit occuring 2 and 3 times respectively or 3 digit each occur 2
times.
Therefore

6
9! we6
have
5 5 5 9! 6


9!
4 2 ( 1 4! + 1 1 2!3! + 3 2!2!2! ).

Case 2:
2 distinct odd digit and 1 distinct even digit

We have 52 51 k1 !k9!2 !k3 ! = 50 k1 !k9!2 !k3 ! . Which result in 50(3 1!1!7!
9! 9! 9! 9! 9! 9!


+ 6 1!2!6! + 6 1!3!5! + 3 1!4!4! + 3 2!2!5! + 6 2!3!4! +
9!
3!3!3! ) Sum both we have 96163500.

5.3.26
(a) 49 , each ring can go to any finger.
(b) We can think it as for every permutation of 9 rings, we put down 3 dividers, each divider are not distinct.
Therefore we have (9 + 3)!/3! ways.

5.4.20
There are 30 20



20 ways to put 20 computer games in bag 1. 15 ways to put
15 toys in bag 2. There is only 1
way to put 15 presents in bag 3 after the first 2 are chosen. There are 30 20


20 15 ways to distribute these 50
presents among the 3 bags.

5.4.34
(a) i Select 30 chips from 5 colors.
ii Amount of non-negative solutions a1 + a2 + a3 + a4 + a5 = 30.
(b) i Select 18 balls from 6 colors, and 2 of each color.
ii Amount of non-negative solutions to a1 + a2 + a3 + a4 + a5 + a6 = 6

1
(c) i Select 20 markers from 4 colors, the amount from the first two color must be the same.
ii Amount of non-negative solutions to 2a1 + a2 + a3 = 20.