The number of ways in which an examiner can a | vedclass

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

Question

(C) Let the marks assigned to the $8$ questions be $x_1, x_2, \dots, x_8$. We are given that $x_1 + x_2 + \dots + x_8 = 30$,where $x_i \ge 2$ for all

Vedclass · Accepted Answer

$^{21}C_7$

Vedclass · Answer

(C) Let the marks assigned to the $8$ questions be $x_1, x_2, \dots, x_8$. We are given that $x_1 + x_2 + \dots + x_8 = 30$,where $x_i \ge 2$ for all $i = 1, 2, \dots, 8$. Let $x_i = y_i + 2$,where $y_i \ge 0$. Substituting this into the equation,we get: $(y_1 + 2) + (y_2 + 2) + \dots + (y_8 + 2) = 30$ $y_1 + y_2 + \dots + y_8 + 16 = 30$ $y_1 + y_2 + \dots + y_8 = 14$. The number of non-negative integer solutions to this equation is given by the formula $^{n+r-1}C_{r-1}$,where $n=14$ and $r=8$. Number of ways $= ^{14+8-1}C_{8-1} = ^{21}C_7$.

The number of ways in which an examiner can assign $30$ marks to $8$ questions,giving not less than $2$ marks to any question,is

Similar Questions

If ${}^n C_7 = {}^n C_6$,then ${}^n C_2 = $

If $^nC_{r-2} = 36$,$^nC_{r-1} = 84$,and $^nC_r = 126$,then the value of $^nC_{2r}$ is

$A$ man has $7$ friends. In how many ways can he invite one or more of them for a tea party?

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:

The least value of $n$ such that ${ }^{(n-1)} C_3 + { }^{(n-1)} C_4 > { }^n C_3$ is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module