Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
1Activity
0 of .
Results for:
No results containing your search query
P. 1
ams301hw8

ams301hw8

Ratings: (0)|Views: 39|Likes:
Published by Chao Xu

More info:

Published by: Chao Xu on Apr 06, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

05/14/2010

pdf

text

original

 
AMS 301 Spring 2010 HW #8
Chao Xu(106978083)
5.3.12
Suppose there is no pink, lavender, tan ball. There are
8+3
18
=
108
Suppose there is one pink or lavenderor tan ball. There are
31

7+3
17
= 3
97
Suppose there are two out of pink, lavender or tan ball. There are
32

6+3
16
= 3
86
. Suppose there contain all of pink, lavender or tan ball. There are
33

5+3
15
=
75
Totalis
108
+ 3
97
+ 3
86
+
75
= 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 digitLet the ith distinct digit occur
k
n
times, then we have
54

52
9!
k
1
!
k
2
!
k
3
!
k
4
!
k
5
!
k
6
!
. Where
k
i
1 and
6
i
=1
k
i
= 9.There can be 1 digit occuring 4 times, 2 digit occuring 2 and 3 times respectively or 3 digit each occur 2times. Therefore we have
54

52
(
61
9!4!
+
61

51
9!2!3!
+
63
9!2!2!2!
).Case 2: 2 distinct odd digit and 1 distinct even digitWe have
52

51
9!
k
1
!
k
2
!
k
3
!
= 50
9!
k
1
!
k
2
!
k
3
!
. Which result in 50(3
9!1!1!7!
+6
9!1!2!6!
+6
9!1!3!5!
+3
9!1!4!4!
+3
9!2!2!5!
+6
9!2!3!4!
+
9!3!3!3!
) Sum both we have 96163500.
5.3.26
(a) 4
9
, 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
3020
ways to put 20 computer games in bag 1.
2015
ways to put 15 toys in bag 2. There is only 1way to put 15 presents in bag 3 after the first 2 are chosen. There are
3020

2015
ways to distribute these 50presents among the 3 bags.
5.4.34
(a) i Select 30 chips from 5 colors.ii Amount of non-negative solutions
a
1
+
a
2
+
a
3
+
a
4
+
a
5
= 30.(b) i Select 18 balls from 6 colors, and 2 of each color.ii Amount of non-negative solutions to
a
1
+
a
2
+
a
3
+
a
4
+
a
5
+
a
6
= 61

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->