Answer:
(a) 3003 ways
(b) 10897286400 ways
(c) 3002 ways
Step-by-step explanation:
Given
[tex]n = 15[/tex] --- 15 players
Solving (a) Ways of selecting 10 players.
This implies combination.
So, we have:
[tex]r=10[/tex]
Using:
[tex]^nC_r = \frac{n!}{(n-r)!r!}[/tex]
We have:
[tex]^{15}C_{10} = \frac{15!}{(15-10)!10!}[/tex]
[tex]^{15}C_{10} = \frac{15!}{5!10!}[/tex]
Simplify
[tex]^{15}C_{10} = \frac{15*14*13*12*11*10!}{5!10!}[/tex]
[tex]^{15}C_{10} = \frac{15*14*13*12*11}{5!}[/tex]
[tex]^{15}C_{10} = \frac{15*14*13*12*11}{5*4*3*2*1}[/tex]
[tex]^{15}C_{10} = \frac{360360}{120}[/tex]
[tex]^{15}C_{10} = 3003[/tex]
Solving (b) Ways of assigning positions to 10 players.
This implies permutation.
So, we have:
[tex]r=10[/tex]
Using:
[tex]^nP_r = \frac{n!}{(n-r)!}[/tex]
We have:
[tex]^{15}P_{10} = \frac{15!}{(15-10)!}[/tex]
[tex]^{15}P_{10} = \frac{15!}{5!}[/tex]
Solve each factorial
[tex]^{15}P_{10} = \frac{1307674368000}{120}[/tex]
[tex]^{15}P_{10} = 10897286400[/tex]
Solving (c) Ways of choosing at least 1 woman
We have:
[tex]Men = 10[/tex]
[tex]Women = 5[/tex]
Ways of selecting 10 players is: (a) 3003 ways
Since the number of men are 10, there is 1 way of selecting 10 men (i.e. selection without women)
Using complement rule:
At least 1 woman = Total - No woman
[tex]At\ least\ 1\ woman = 3003 - 1[/tex]
[tex]At\ least\ 1\ woman = 3002[/tex]