In an examination of 9 papers,a candidate is | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(B) Let $n = 9$ be the total number of papers. Let $p$ be the number of papers passed and $f$ be the number of papers failed,where $p + f = 9$.The can

Vedclass · Accepted Answer

$256$

Vedclass · Answer

(B) Let $n = 9$ be the total number of papers. Let $p$ be the number of papers passed and $f$ be the number of papers failed,where $p + f = 9$.The candidate is successful if $p > f$. Since $p = 9 - f$,the condition $p > f$ becomes $9 - f > f$,which implies $2f Thus,the candidate is successful if they fail in $0, 1, 2, 3,$ or $4$ papers.The candidate is unsuccessful if they fail in $5, 6, 7, 8,$ or $9$ papers.The number of ways to be unsuccessful is the sum of combinations: $\binom{9}{5} + \binom{9}{6} + \binom{9}{7} + \binom{9}{8} + \binom{9}{9}$.Using the property $\binom{n}{r} = \binom{n}{n-r}$,this is equal to $\binom{9}{4} + \binom{9}{3} + \binom{9}{2} + \binom{9}{1} + \binom{9}{0}$.We know that the sum of all binomial coefficients $\sum_{k=0}^{9} \binom{9}{k} = 2^9 = 512$.Since $\sum_{k=0}^{9} \binom{9}{k} = (\binom{9}{0} + \binom{9}{1} + \binom{9}{2} + \binom{9}{3} + \binom{9}{4}) + (\binom{9}{5} + \binom{9}{6} + \binom{9}{7} + \binom{9}{8} + \binom{9}{9}) = 512$,and both sums are equal,each sum is $\frac{512}{2} = 256$.Therefore,the number of ways to be unsuccessful is $256$.

In an examination of $9$ papers,a candidate is successful only if they pass in more papers than they fail. In how many ways can the candidate be unsuccessful?

Similar Questions

In how many ways can $12$ balls be distributed between two friends such that one gets $8$ balls and the other gets $4$ balls?

If $\binom{n-1}{4}$,$\binom{n-1}{5}$,and $\binom{n-1}{6}$ are in arithmetic progression,find $n$.

The value of $\frac{{}^{10}C_{r}}{{}^{11}C_{r}}$,when both the numerator and denominator are at their greatest values,is

From all the English alphabets,five letters are chosen and are arranged in alphabetical order. The total number of ways,in which the middle letter is $M$,is:

$^nC_{r+1} + ^nC_{r-1} + 2^nC_r = \dots$

Vedclass Test Series

Exam Paper Generator

Online Exam Module