Statement 1: `^m C_r+^m C_(r-1)^n C_1+^mC_(r-2)^n C_2++^n C_r=0,ifm+n

If n is a positive integer such that (1+x)^n=^nC_0+^nC_1+^nC_2x^2+…….+^nC_nx^n, for epsilonR . Also ^nC_r=C_r On the basis o the above information answer the following questions the value of ^mC_r.^nC_0+^mC_(r-1).^nC_1+^mC_(r-2).^nC_2+….+^mC_1.^nC_(r-1)+^nC_0^nC_r where m,n, r are positive interges and rltm,rltn= (A) ^(mn)C_r (B) ^(m+n)C_r (C) 0 (D) 1

mC_(r)+mC_(r-1)nC_(1)+mC_(r-2)nC_(2)+.........+nC_(r)=(m+n)C_(r)

Statement-1 : The sum of the series ^nC_0. ^mC_r+^nC_1.^mC_(r-1)+^nC_2.^mC_(r-2)+......+^nC_r.^mC_0 is equal to ^(n+m)C_r, where C's and C's denotes the combinatorial coefficients in the expansion of (1 + x)^n and (1 + x)^m respectively, Statement-2: Number of ways in which r children can be selected out of (n + m) children consisting of n boys and m girls if each selection may consist of any number of boys and girls is equal to ^(n+m)C_r

Statement-1: sum_(r =0)^(n) (r +1)""^(n)C_(r) = (n +2) 2^(n-1) Statement -2: sum_(r =0)^(n) (r+1) ""^(n)C_(r) x^(r) = (1 + x)^(n) + nx (1 + x)^(n-1)

If m,n,r are positive integers such that r lt m,n, then ""^(m)C_(r)+""^(m)C_(r-1)""^(n)C_(1)+""^(m)C_(r-2)""^(n)C_(2)+...+ ""^(m)C_(1)""^(n)C_(r-1)+""^(n)C_(r) equals

Statement -1: sum_(r=0)^(n) r(""^(n)C_(r))^(2) = n (""^(2n -1)C_(n-1)) Statement-2: sum_(r=0)^(n) (""^(n)C_(r))^(2)= ""^(2n)C_(n)

""^(n)C_(r+1)+^(n)C_(r-1)+2.""^(n)C_(r)=

Let m, in N and C_(r) = ""^(n)C_(r) , for 0 le r len Statement-1: (1)/(m!)C_(0) + (n)/((m +1)!) C_(1) + (n(n-1))/((m +2)!) C_(2) +… + (n(n-1)(n-2)….2.1)/((m+n)!) C_(n) = ((m + n + 1 )(m+n +2)…(m +2n))/((m +n)!) Statement-2: For r le 0 ""^(m)C_(r)""^(n)C_(0)+""^(m)C_(r-1)""^(n)C_(1) + ""^(m)C_(r-2) ""^(n)C_(2) +...+ ""^(m)C_(0)""^(n)C_(r) = ""^(m+n)C_(r) .