જો $C_{x} \equiv^{25} C_{x}$ અને $\mathrm{C}_{0}+5 \cdot \mathrm{C}_{1}+9 \cdot \mathrm{C}_{2}+\ldots .+(101) \cdot \mathrm{C}_{25}=2^{25} \cdot \mathrm{k}$ હોય તો  $\mathrm{k}$ મેળવો.

વિધાન $1$: $\mathop \sum \limits_{r = 0}^n \left( {r + 1} \right)\left( {\begin{array}{*{20}{c}}n\\r\end{array}} \right) = \left( {n + 2} \right){2^{n – 1}}$

વિધાન $2$:$\;\mathop \sum \limits_{r = 0}^n \left( {r + 1} \right)\left( {\begin{array}{*{20}{c}}n\\r\end{array}} \right){x^r}\; = {\left( {1 + x} \right)^n} + nx{\left( {1 + x} \right)^{n – 1}}$

જો ${a_k} = \frac{1}{{k(k + 1)}},$( $k = 1,\,2,\,3,\,4,…..,\,n$), તો ${\left( {\sum\limits_{k = 1}^n {{a_k}} } \right)^2} = $

ધારો કે પૂર્ણાકો $n$ અને $r$ માટે $\left(\begin{array}{l} n \\ r \end{array}\right)=\left\{\begin{array}{ll}{ }^{n} C _{ r }, & \text { if } n \geq r \geq 0 \\ 0, & \text { otherwise }\end{array}\right.$ છે. તો સરવાળા $\sum_{i=0}^{k}\left(\begin{array}{c}10 \\ i\end{array}\right)\left(\begin{array}{c}15 \\ k-i\end{array}\right)+\sum_{i=0}^{k+1}\left(\begin{array}{c}12 \\ i\end{array}\right)\left(\begin{array}{c}13 \\ k+1-i\end{array}\right)$ નું અસ્તિત્વ હોય, તેવી $k$ ની મહત્તમ કિમત …… છે.