The sum sumlimits_{i = 0}^m {left( {begin{arr | vedclass

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

Question

(b) For $ m$ $ = 5,\,\,\,\,\sum\limits_{i = 0}^5 {\left( \begin{array}{l}\,10\,\\,\,i\end{array} ight)\,\left( \begin{array}{l}\,\,20\,\5 - i\,\en

Vedclass · Accepted Answer

$15$

Vedclass · Answer

(b) For $ m$ $ = 5,\,\,\,\,\sum\limits_{i = 0}^5 {\left( \begin{array}{l}\,10\,\\,\,i\end{array} ight)\,\left( \begin{array}{l}\,\,20\,\5 - i\,\end{array} ight)} $

$ = \left( \begin{array}{l}\,10\\,\,0\end{array} ight)\,\,\left( \begin{array}{l}20\\,5\end{array} ight)\,\, + \,\left( \begin{array}{l}10\\,1\end{array} ight)\,\left( \begin{array}{l}20\\,4\end{array} ight)\, + ... + \left( \begin{array}{l}10\\,5\end{array} ight)\,\left( \begin{array}{l}20\\,0\end{array} ight),$

for $m = 10$, $\sum\limits_{i = 0}^{10} {\left( \begin{array}{l}\,10\,\\,\,i\end{array} ight)\,\left( \begin{array}{l}\,\,20\,\10 - i\,\end{array} ight)} $
$ = \left( \begin{array}{l}10\\,0\end{array} ight)\,\left( \begin{array}{l}20\10\end{array} ight) + \left( \begin{array}{l}10\\,1\end{array} ight)\,\left( \begin{array}{l}20\\,9\,\end{array} ight) + \left( \begin{array}{l}10\\,2\end{array} ight)\,\left( \begin{array}{l}20\\,8\,\end{array} ight)$$ + ... + \left( \begin{array}{l}10\,\10\end{array} ight)\,\left( \begin{array}{l}20\\,0\end{array} ight)$,
for m = 15, $\sum\limits_{i = 0}^{15} {\left( \begin{array}{l}\,10\,\\,\,i\end{array} ight)\,\left( \begin{array}{l}\,\,\,20\,\15 - i\,\end{array} ight)} $
$ = \left( \begin{array}{l}\,10\\,\,0\end{array} ight)\,\,\left( \begin{array}{l}20\\,15\end{array} ight)\,\, + \,\left( \begin{array}{l}10\\,1\end{array} ight)\,\left( \begin{array}{l}20\1\,4\end{array} ight)\, + \left( \begin{array}{l}10\\,2\end{array} ight)\,\left( \begin{array}{l}20\\,13\end{array} ight) + .. + \left( {\begin{array}{*{20}{c}}{10}\{10}\end{array}} ight)\,\left( {\begin{array}{*{20}{c}}{20}\5\end{array}} ight)$

and for $m = 20$, $\sum\limits_{i = 0}^{20} {\left( \begin{array}{l}\,10\,\\,\,i\end{array} ight)\,\left( \begin{array}{l}\,\,\,20\,\20 - i\,\end{array} ight)} $
$ = \left( \begin{array}{l}\,10\\,\,0\end{array} ight)\,\,\left( \begin{array}{l}20\20\end{array} ight)\,\, + \,\left( \begin{array}{l}10\\,1\end{array} ight)\,\left( \begin{array}{l}20\1\,9\end{array} ight)\, + ... + \left( \begin{array}{l}10\10\end{array} ight)\,\left( \begin{array}{l}20\\,10\end{array} ight)$

Clearly, the sum is maximum for $m = 15$.

Note that $^{10}{C_r}$ is maximum for $r = 5$ and $^{20}{C_r}$ is maximum for $r = 10$. Note that the single term $^{10}{C_5}\, 	imes {\,^{20}}{C_{10}}\,$(in case m = 15) is greater than the sum

$^{10}{C_0}{\,^{20}}{C_{10}}\, + {\,^{10}}{C_1}{\,^{20}}{C_9}\, + {\,^{10}}{C_2}{\,^{20}}{C_8}\, + .....$

$^{10}{C_8}{\,^{20}}{C_2}\, + {\,^{10}}{C_9}{\,^{20}}{C_1}\, + {\,^{10}}{C_{10}}{\,^{20}}{C_0}$ (in case $m = 10$).

Also the sum in case $m = 10$ is same as that in case $m = 20.$

The sum $\sum\limits_{i = 0}^m {\left( {\begin{array}{{20}{c}}{10}\\i\end{array}} \right)} \,\left( {\begin{array}{{20}{c}}{20}\\{m - i}\end{array}} \right)\,,$ $\left( {{\rm{where}}\,\left( {\begin{array}{*{20}{c}}p\\q\end{array}} \right)\, = 0\,{\rm{if}}\,p < q} \right)$, is maximum when m is

Similar Questions

A group of $9$ students, $s 1, s 2, \ldots, s 9$, is to be divided to form three teams $X, Y$ and, $Z$ of sizes $2,3$ , and $4$, respectively. Suppose that $s_1$ cannot be selected for the team $X$, and $s_2$ cannot be selected for the team $Y$. Then the number of ways to form such teams, is. . . .

The number of arrangements of the letters of the word $SATAYPAUL$ such that no two $A$ are together and middle letter is consonant, is

In how many ways can a girl and a boy be selected from a group of $15$ boys and $8 $ girls

There are $3$ sections in a question paper and each section contains $5$ questions. A candidate has to answer a total of $5$ questions, choosing at least one question from each section. Then the number of ways, in which the candidate can choose the questions, is

If for some $\mathrm{m}, \mathrm{n} ;{ }^6 \mathrm{C}_{\mathrm{m}}+2\left({ }^6 \mathrm{C}_{\mathrm{m}+1}\right)+{ }^6 \mathrm{C}_{\mathrm{m}+2}>{ }^8 \mathrm{C}_3$ and ${ }^{n-1} P_3:{ }^n P_4=1: 8$, then ${ }^n P_{m+1}+{ }^{n+1} C_m$ is equal to

The sum $\sum\limits_{i = 0}^m {\left( {\begin{array}{*{20}{c}}{10}\\i\end{array}} \right)} \,\left( {\begin{array}{*{20}{c}}{20}\\{m - i}\end{array}} \right)\,,$ $\left( {{\rm{where}}\,\left( {\begin{array}{*{20}{c}}p\\q\end{array}} \right)\, = 0\,{\rm{if}}\,p < q} \right)$, is maximum when m is