edited by
2,304 views
19 votes
19 votes

We need to choose a team of $11$ from a pool of $15$ players and also select a captain. The number of different ways this can be done is

  1. $ \begin{pmatrix} 15 \\ 11 \end{pmatrix}$
  2. $11$ . $ \begin{pmatrix} 15 \\ 11 \end{pmatrix}$
  3. $15 . 14 . 13 . 12 . 11 .10 . 9 . 8 . 7 . 6 . 5$
  4. $(15 . 14 . 13 . 12 . 11 .10 . 9 . 8 . 7 . 6 . 5) . 11$
edited by

3 Answers

Best answer
19 votes
19 votes

Number of ways selecting a captain from $15$ players $= \begin{pmatrix} 15 \\ 1 \end{pmatrix}$

Number of ways selecting remaining team members from remaining $14$ players $=\begin{pmatrix} 14 \\ 10 \end{pmatrix}$  

The number of different ways to choose a team of $11$ from a pool of $15$ players and

also select a captain,

                                         $= \begin{pmatrix} 15\\ 1 \end{pmatrix}$ *$ \begin{pmatrix} 14 \\ 10 \end{pmatrix}$

                                         $ =15*13*11*7$ 

                                         $= 11 * \begin{pmatrix} 15 \\ 11 \end{pmatrix}$

Hence,Option (B) is the correct choice.

edited by
15 votes
15 votes

We can divide the task (S) into 2 sub-task.

S1- Choosing a team of 11 from 15 players

S2- Now selecting a caption from that team.

After that required no. of ways can be obtained by applying product rule.

S= S1.S2

Choosing a team of 11 from 15 players can be done in $\binom{15}{11}$ ways.

Now selecting a caption from that team of 11 players can be done in 11  ways.

So total no, of ways=  11.$\binom{15}{11}$ 

So B is the correct option.

2 votes
2 votes

choose a team of 11 from a pool of 15 players

select 11 players from 15 players =  $\binom{15}{11}$ ways

also select a captain


we have to select a captain from the 11 selected members and it can be done in   $\begin{pmatrix}11 \\ 1\end{pmatrix}$ ways = 11 ways.

The number of different ways this can be done is


i.e. the total combinations ( ways) possibe are   11 * $\begin{pmatrix}15 \\ 11\end{pmatrix}$ ways

edited by
Answer:

Related questions

4 votes
4 votes
1 answer
1
2 votes
2 votes
2 answers
2
go_editor asked May 19, 2016
627 views
Let $G$ be a graph in which each vertex has degree at least $k$. Show that there is a path of length $k$ in $G$—that is, a sequence of $k+1$ distinct vertices $v_0, v_1...