Statement-1: The number of ways of distributi | vedclass

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

Question

(D) For Statement-$1$: The number of ways to distribute $n$ identical items into $r$ distinct boxes such that no box is empty is given by the formula

Vedclass · Accepted Answer

Statement-$1$ is true,Statement-$2$ is true; Statement-$2$ is a correct explanation for Statement-$1$.

Vedclass · Answer

(D) For Statement-$1$: The number of ways to distribute $n$ identical items into $r$ distinct boxes such that no box is empty is given by the formula $^{n-1}C_{r-1}$.Here,$n = 10$ and $r = 4$.So,the number of ways is $^{10-1}C_{4-1} = ^9C_3$.Thus,Statement-$1$ is true.For Statement-$2$: The number of ways to choose $r$ items from $n$ distinct items is $^nC_r$.Here,$n = 9$ and $r = 3$,so the number of ways is $^9C_3$.Thus,Statement-$2$ is true.Since the formula for distributing identical items into distinct boxes (stars and bars method) is derived using the concept of choosing positions,Statement-$2$ is the correct explanation for Statement-$1$.

Statement-$1:$ The number of ways of distributing $10$ identical balls in $4$ distinct boxes such that no box is empty is $^9C_3$.
Statement-$2:$ The number of ways of choosing any $3$ places from $9$ different places is $^9C_3$.

Similar Questions

Out of $6$ books,in how many ways can a set of one or more books be chosen?

If $^nC_r = 84$,$^nC_{r-1} = 36$,and $^nC_{r+1} = 126$,then $n = ..........$

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

If $^{15}C_{3r} = ^{15}C_{r+3}$,find the value of $r$.

$A$ student is required to answer $10$ questions out of $13$ in an examination,such that he must choose at least $4$ questions from the first $5$ questions. How many ways can he make the selection?

Vedclass Test Series

Exam Paper Generator

Online Exam Module

Statement-$1:$ The number of ways of distributing $10$ identical balls in $4$ distinct boxes such that no box is empty is $^9C_3$.Statement-$2:$ The number of ways of choosing any $3$ places from $9$ different places is $^9C_3$.