MCQ
Let $S=\left\{E, E_{2} \ldots . E_{8}\right\}$ be a sample space of random experiment such that $P\left(E_{n}\right)=\frac{n}{36}$ for every $n =1,2 \ldots .$. Then the number of elements in the set $\left\{ A \subset S : P ( A ) \geq \frac{4}{5}\right\}$ is
  • A
    $17$
  • B
    $18$
  • $19$
  • D
    $20$

Answer

Correct option: C.
$19$
c
$P \left( A ^{\prime}\right)<\frac{1}{5}=\frac{36}{180}$

$5$ times the sum of missing number should be less than $36 .$

If $1$ digit is missing $=7$

If $2$ digit is missing $=9$

If $3$ digit is missing $=2$

If $0$ digit is missing $=1$

Alternate

$A$ is subset of $S$ hence

$A$ can have elements:

type $1:\{\}$

type $2$: $\left\{E_{1}\right\},\left\{E_{2}\right\}, \ldots \ldots .\left\{E_{8}\right\}$

type $3$: $\left\{ E _{1}, E _{2}\right\},\left\{ E _{1}, E _{3}\right\} \ldots \ldots .\left\{ E _{1}, E _{ 8 }\right\}$

.

.

.

type $6$: $\left\{ E _{1}, E _{2}, \ldots \ldots E _{5}\right\}, \ldots \ldots\left\{ E _{4}, E _{5}, E _{6}, E _{7}, E _{8}\right\}$

type $7$: $\left\{ E _{1}, E _{2}, \ldots \ldots . . E _{6}\right\}, \ldots \ldots .\left\{ E _{3}, E _{4}, \ldots \ldots \ldots . . E _{ 8 }\right\}$

type $8$: $\left\{ E _{1}, E _{2}, \ldots \ldots . E _{9}\right\}\left\{ E _{2}, E _{3}, \ldots \ldots \ldots . E _{8}\right\}$

type $9$: $\left\{ E _{1}, E _{2}, \ldots \ldots . . E _{ 8 }\right\}$

As $P ( A ) \geq \frac{4}{5}$

Note : Type $1$ to Type $4$ elements can not be in set

$A$ as maximum probability of type $4$ elements.

$\left\{ E _{5}, E _{6}, E _{ 7 }, E _{ s }\right\}$ is $\frac{5}{36}+\frac{6}{36}+\frac{7}{36}+\frac{8}{36}=\frac{13}{18}<\frac{4}{5}$

Now for Type $5$ acceptable elements let's call probability as $P _{ 5 }$

$P _{5}=\frac{ n _{1}+ n _{2}+ n _{3}+ n _{4}+ n _{5}}{36} \leq \frac{4}{5}$

$\Rightarrow n _{1}+ n _{2}+ n _{3}+ n _{4}+ n _{5} \geq 28.8$

Hence, $2$ possible ways $\left\{ E _{9}, E _{6}, E _{\eta}, E _{\varepsilon}, E _{3}\right.$ or $\left.E _{4}\right\}$

$P _{6}= n _{1}+ n _{2}+ n _{3}+ n _{4}+ n _{5}+ n _{6} \geq 28.8$

$\Rightarrow 9$ possible ways

$P _{8} \Rightarrow n _{1}+ n _{2}+\ldots \ldots \ldots+ n _{1} \geq 288$

$\Rightarrow 7$ possible ways

$P _{ 8 } \Rightarrow n _{1}+ n _{2}+\ldots \ldots \ldots+ n _{ 8 } \geq 28.8$

$\Rightarrow 1$ possible way

Total $=19$

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free

Similar questions

The position vectors of the points A, B, C are $2\hat{\text{i}}+\hat{\text{j}}-\hat{\text{k}},\ 3\hat{\text{i}}-2\hat{\text{j}}+\hat{\text{k}}$ and $\hat{\text{i}}+4\hat{\text{j}}-3\hat{\text{k}}$ respectively. These points,
  1. Form an isosceles triangle.
  2. Form a right triangle.
  3. Are collinear.
  4. Form a scalene triangle.
If the function $f(x) = a{x^3} + b{x^2} + 11x - 6$ satisfies the conditions of Rolle's theorem for the interval $[1, 3$] and $f'\left( {2 + \frac{1}{{\sqrt 3 }}} \right) = 0$, then the values of $a$ and $b$ are respectively
The value of $\alpha$ for which $4 \alpha \int\limits_{-1}^{2} \mathrm{e}^{-\alpha \mathrm{|x|} } \mathrm{d} \mathrm{x}=5,$ is 
The value of $\int_{ - 2}^2 {(a{x^3} + bx + c)} $ depends on
A polynomial function $f(x)$ satisfying the conditions $f(x) = [f ‘ (x)]^2$ & $\int\limits_0^1 {} f(x) dx =$$\frac{{19}}{{12}}$ can be:
Matrix ${A_\lambda } = \left[ {\begin{array}{*{20}{c}}
  \lambda &{\lambda  - 1} \\ 
  {\lambda  - 1}&\lambda  
\end{array}} \right],\lambda  \in N$ then the value of $\left| {{A_1}} \right| + \left| {{A_2}} \right| + \left| {{A_3}} \right| + ....... + \left| {{A_{300}}} \right|$ is
If $f(x)$ = $\left\{ \begin{subarray}{l} 
  k\,\cos \,x\, - \,x\,\cos \,k\,\,\,x\, \in \,\left[ {0,\,\frac{\pi }{2}} \right] \\ 
  k\,\sin \,x\, + \,x\,\sin \,k\,\,\,\,x\, \in \,\left( {\frac{\pi }{2},\,\pi } \right]\, 
\end{subarray}  \right.$ is differentiable in $(0,\pi )$ , then
If $y = 1 + x + {{{x^2}} \over {2\,!}} + {{{x^3}} \over {3\,!}} + ..... + {{{x^n}} \over {n\,!}}$, then ${{dy} \over {dx}} = $
The locus of  a point equidistant from two given points $ a$  and $ b $ is given by
The solution of the set of constraints of a linear programming problem is a convex (open or closed) is called ______ region.
  1. Feasible
  2. Active
  3. Linear
  4. None of these