recategorized by
1,914 views
2 votes
2 votes

Suppose in a competition $11$ matches are to be played, each having one of $3$ distinct outcomes as possibilities. The number of ways one can predict the outcomes of all $11$ matches such that exactly $6$ of the predictions turn out to be correct is

  1. $\begin{pmatrix}11 \\ 6 \end{pmatrix} \times 2^5$
  2. $\begin{pmatrix}11 \\ 6 \end{pmatrix} $
  3. $3^6$
  4. none of the above
recategorized by

3 Answers

3 votes
3 votes
Consider the outcomes of each match being win(w) , loss(l) or draw(d)...

.

Now for 6matches the prediction turns out to be correct which can be done in 11C6 ways but now other five matches will have incorrect prediction means if we predict w it should be l or d.. and soon..

.

Therefore for five matches will be predicted in  2^5 ways...

.

Hence total number of predictions will be 11C6* 2^5. Option A...
2 votes
2 votes

 Each match has 3 possible outcomes.

For 11 matches,on total there are $3^{11}$ ways of prediction.

for each match,probability that our prediction is correct is 1/3.

Hence the probability that our prediction is wrong is 2/3.

Let X be the random variable that counts number of correct predictions.

therefore P(X=6)=$\binom{11}{6}$*$\left ( 1/3 \right )^{6}$*$\left ( 2/3 \right )^{5}$.(by Binomial theorem)

Total number of ways in which exactly 6 predictions are correct= probability that exactly 6 predictions are correct*Total number of predictions.

=$\binom{11}{6}$*$\left ( 1/3 \right )^{6}$*$\left ( 2/3 \right )^{5}$  * $3^{11}$.

=$\binom{11}{6}$ * $2^{5}$

 

 

0 votes
0 votes
Each match can have outcome Win, Loose or Tie, so total possibilities of outcome  $ = 3^{11}$

But we have to find exactly 6 out of any 11 matches, so this can be done in $11 \choose 6$ ways.

Now for each of the chosen match must have correct prediction which can be done in only $1$ way.

So the total number of ways of predicting exactly 6 matches correctly

= $  11 \choose 6$ $* 1$

= $  11 \choose 6$

Hence answer is $B$

Related questions

1 votes
1 votes
3 answers
2
Arjun asked Sep 23, 2019
1,391 views
Let $A$ be a set of $n$ elements. The number of ways, we can choose an ordered pair $(B,C)$, where $B,C$ are disjoint subsets of $A$, equals$n^2$$n^3$$2^n$$3^n$
1 votes
1 votes
1 answer
3
0 votes
0 votes
1 answer
4
Arjun asked Sep 23, 2019
764 views
Let $\sigma$ be the permutation:$$\begin{array} {}1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 \\ 3 & 5 & 6 & 2 & 4 & 9 & 8 & 7 & 1, \end{array}$$ $I$ be the identity permutation an...