If $(1+x)^n = C_0 + C_1 x + C_2 x^2 + \ldots + C_n x^n$,then $C_0 + 2 C_1 + 3 C_2 + \ldots + (n+1) C_n$ is equal to

If $\sum\limits_{K = 1}^{12} {12K \cdot {^{12}C_K} \cdot {^{11}C_{K - 1}}} $ is equal to $\frac{{12 \times 21 \times 19 \times 17 \times \dots \times 3}}{{11!}} \times {2^{12}} \times p$,then $p$ is:

If $n$ is a positive integer greater than $1$,then $3({ }^n C_0) - 8({ }^n C_1) + 13({ }^n C_2) - 18({ }^n C_3) + \ldots$ up to $(n+1)$ terms $=$

If $(1 + x)^n = \sum\limits_{r = 0}^n {{C_r}{x^r}} $,then $\left( {1 + \frac{{{C_1}}}{{{C_0}}}} \right)\left( {1 + \frac{{{C_2}}}{{{C_1}}}} \right)....\left( {1 + \frac{{{C_n}}}{{{C_{n - 1}}}}} \right) = $

If $\frac{{}^{11}C_1}{2} + \frac{{}^{11}C_2}{3} + \dots + \frac{{}^{11}C_9}{10} = \frac{n}{m}$ with $\gcd(n, m) = 1$,then $n + m$ is equal to

Let $\binom{n}{k}$ denote ${}^{n}C_{k}$ and $\left[\begin{array}{c} n \\ k \end{array}\right]=\begin{cases} \binom{n}{k}, & \text{if } 0 \leq k \leq n \\ 0, & \text{otherwise} \end{cases}$. If $A_{k}=\sum_{i=0}^{9}\binom{9}{i}\left[\begin{array}{c} 12 \\ 12-k+i \end{array}\right]+\sum_{i=0}^{8}\binom{8}{i}\left[\begin{array}{c} 13 \\ 13-k+i \end{array}\right]$ and $A_{4}-A_{3}=190p$,then $p$ is equal to: