Assignment 3
Solution #1:
12 jurors from 25 prospective jurors (combination):
25 ! 25 ! 25× 24 ×23 × 22× 21× 20× 19× 18 ×17 ×16 ×15 × 14
C(25,12) = = = =
12! ×(25−12)! 12! × 13! 12×11 ×10 × 9× 8 ×7 × 6× 5 ×4 ×3 ×2 ×1
5,200,300
2 alternates from the rest of 13 prospective jurors (combination):
13 ! 13 ! 13× 12
C(13,2) = = = = 78
2! ×(13−2)! 2! × 11! 2
Total # of choosing 12 jurors and 2 alternates: 5,200,300 * 78 = 405,623,400
Solution #2:
7! 14 !
2 red balls: C(7,2)*C(14,4) = × = 21,021
2!× 5! 4 !×10 !
7! 14 ! 7 ×6 ×5 14 ×13 × 12
3 red balls: C(7,3)*C(14,3) = × = × = 12,740
3!× 4 ! 3 ! ×11 ! 3 ×2 3 ×2
7! 14 ! 7 ×6 ×5 14 ×13
4 red balls: C(7,4)*C(14,2) = × = × = 3,185
4 ! × 3! 2 !×12 ! 3 ×2 2
7! 14 ! 7 ×6 14
5 red balls: C(7.5) *C(14,1) = × = × = 294
5!× 2! 1 ! ×13 ! 2 1
7! 14 !
6 red balls: C(7,6)*C(14,0) = × =7
6 ! ×1 ! 0 ! ×14 !
Total samples contain at least 2 red balls = 21,021 + 12,740 + 3,185 + 294 + 7 = 37,247
Solution #3:
9 ×8 ×7 × 6
Choose 4 rap videos from 9 (combination): C(9,4) = = 126
4 × 3 ×2
5× 4 × 3
Choose 3 R&B videos from 5 (combination): C(5,3) = = 10
3 ×2
So in total, there are 126 ×10=1260 ways
For each of the group of 7 videos (4 rap and 3 R&B), considering the order of videos, there are
7 ×6 × 5× 4 × 3 ×2 ×1 = 5040 ways of line them up.
So the total # of line-ups is: 1260 ×5040=6,350,400
Solution #4:
(199 )= 9 ! × 19( 19−9
!
)!
=
19× 18× 17 ×16 ×15 ×14 ×13 ×12 ×11
9 ×8 × 7 ×6 ×5 × 4 × 3× 2× 1
= 92,378
(390 ) = 0 ! × 39( 39−0
!
=
39!
) ! 39!
=1
(n2 ) = 2! × n( n−2
!
)!
=
n ×(n−1)× ( n−2 ) ! n ×(n−1)
2 × ( n−2 ) !
=
2
The answer is G.
Solution #5:
(a) Coefficient of x3y14 = (1714 ) = 14 ! × 17( 17−14
!
)!
=
17 ×16 ×15
3 ×2
= 680
=( )=
17 17 ! 17
(b) Coefficient of xy16 = = 17
16 16 ! ×(17−16)! 1
Solution #6:
Students can complete 2 questions out of 25, 3 questions out of 25, 4 questions out of 5: C(25,4) ….
24 questions out of 25 and 25 questions out of 25: C(25,25)
Total different ways to complete assignments answering at least 2 questions:
C(25,2) + C(25,3) + C(25,4) +C(25,5) + C(25,6) + C(25,7) + C(25,8) + C(25,9) + C(25,10) +
C(25,11) + C(25,12) + C(25,13) + C(25,14) + C(25, 15) + C(25,16) + C(25,17) + C(25,18) +
C(25,19) + C(25, 20) + C(25,21) + C(25,22) + C(25,23) + C(25,24) + C(25,25)
= 2 x [C(25,2) + C(25,3) + C(25,4) +C(25,5) + C(25,6) + C(25,7) + C(25,8) + C(25,9) + C(25,10) +
C(25,11) + C(25,12)] + C(25,24) + C(25,25)
= 2 * (300 + 2300 + 12650 + 53130 + 177100 + 480700 + 1081575 + 2042975 + 3268760 +
4457400 + 5200300) + 25 + 1
= 2 * 16,777,190 + 36 = 33,554,380 = 33,554,406
( because C(25,2) = C(25,23), C(25,3) = C(25,22), ………. C(25,12) = C(25,13) , there are total 11 pairs.)
Second solution #6:
Total different ways to complete at least 2 questions = 2 25 – C(25,0) – C(25,1) = 33,554,406
Solution #7:
E and G: These two are mutually exclusive because E∩G = ф
E’: Any car that is not blue; FᴜG = the car is a Toyota or a green Ford. They are not mutually exclusive
because a green Ford is also in E’.
FᴜG’ = the car is a Toyota or any car that is not a green car, for example a blue Toyota, it is not mutually
exclusive with E.
The answer is G.
P ( n , r )=n ( n−1 )( n−2 ) … … ( n−r +1 ) (r factors )
P(n ,r ) n ( n−1 ) ( n−2 ) … … (n−r +1)
C (n , r )= =
r! r ( r−1 ) ( r−2 ) … … .2 ×1
