Question

A man wants to buy ' $m$ ' mangoes in ' $n$ ' different varieties, mangoes of the same variety being identical and they are available in abundance. Number of different ways he can plan his purchases, if he has to buy atleast two mangoes of the same variety is

• A. ${ }^{m-2 n} C_{n-1}$
• B. ${ }^{ m + n -3} C _{ m -1}$
• C. $^{ m + n -1} C _{ m }-{ }^{ n } C _{ m }$
• D. $\frac{{ }^{m+n-1} P_{n-1}-{ }^n P_m}{m !}$

Answer 1

Answer: (C)

Treat each of $V_1 V_2 \ldots \ldots \ldots V_n$ varieties as $n$ beggars.
Total ways when $m$ mangoes can be taken without any restriction $=m+n-1 C_m$
Now ${ }^{ m + n -1} C _{ m }=$ All of same variety $+( m -1)$ of same variety and 1 diff. $+( m -2)$ of same variety and 2 diff. $+\ldots \ldots . .+$ all ' $m$ ' of diff. variety
At least two mangoes of the same variety $($ say $x)=$ Total - All $m$ of different variety
$={ }^{m+n-1} C_m-{ }^n C_m \Rightarrow(C)$