If sumlimits_{i = 0}^4 {^{4 + 1}} {C_i} + sum | vedclass

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

Question

$\left( {{{\mkern 1mu} ^4}{C_0} + {{\mkern 1mu} ^5}{C_1} + {{\mkern 1mu} ^6}{C_2} + {{\mkern 1mu} ^7}{C_3} + {{\mkern 1mu} ^8}{C_4}} \right)$

$ + {

Vedclass · Accepted Answer

$(x - y)$ and $(x + y)$ will always be co-prime numbers.

Vedclass · Answer

$\left( {{{\mkern 1mu} ^4}{C_0} + {{\mkern 1mu} ^5}{C_1} + {{\mkern 1mu} ^6}{C_2} + {{\mkern 1mu} ^7}{C_3} + {{\mkern 1mu} ^8}{C_4}} \right)$

$ + {\mkern 1mu} \left( {^9{C_6} + {{\mkern 1mu} ^{10}}{C_7} + {{\mkern 1mu} ^{11}}{C_8} + {{\mkern 1mu} ^{12}}{C_9}} \right)$

$\left. { = ({\,^5}{C_0} + {\,^5}{C_1} + {\,^6}{C_2} + {\,^7}{C_3} + {\,^8}{C_4}} \right)$

$ + {\mkern 1mu} \left( {^9{C_6} + {{\mkern 1mu} ^{10}}{C_7} + {{\mkern 1mu} ^{11}}{C_8} + {{\mkern 1mu} ^{12}}{C_9}} \right)$

$ = {\,^9}{C_4} + \,\left( {^9{C_6} + {\,^{10}}{C_7} + {\,^{11}}{C_8} + {\,^{12}}{C_9}} \right)$

$ = {\,^9}{C_5} + {\,^9}{C_6} + {\,^{10}}{C_7} + {\,^{11}}{C_8} + {\,^{12}}{C_9} = {\,^{13}}{C_9}{\rm{ \,\,\,or}}\,\,\,{{\rm{ }}^{13}}{C_4}$

If $\sum\limits_{i = 0}^4 {^{4 + 1}} {C_i} + \sum\limits_{j = 6}^9 {^{3 + j}} {C_j} = {\,^x}{C_y}$ ($x$ is prime number), then which one of the following is incorrect

Similar Questions

The number of ways in which $21$ identical apples can be distributed among three children such that each child gets at least $2$ apples, is

If $\frac{{{}^{n + 2}{C_6}}}{{{}^{n - 2}{P_2}}} = 11$, then $n$ satisfies the equation

Team $'A'$ consists of $7$ boys and $n$ girls and Team $'B'$ has $4$ boys and $6$ girls. If a total of $52$ single matches can be arranged between these two teams when a boy plays against a boy and a girl plays against a girl, then $n$ is equal to

The value of $\sum \limits_{ r =0}^{20}{ }^{50- r } C _{6}$ is equal to

$10$ different letters of English alphabet are given. Out of these letters, words of $5$ letters are formed. How many words are formed when at least one letter is repeated