If nCr denotes the number of combinations of n things taken r at a time, then the expression nCr+1+nCr−1+2×nCr equals
Let r and n be positive integers such that 1≤r≤n. Then prove the following :
(i) nCrnCr−1=n−r+1r (ii) nn−1Cr−1=(n−r+1)nCr−1 (iii) nCrn−1Cr−1=nr (iv) nCr+2nCr−1+nCr−2=n+2Cr
For 1≤r≤n , the value of \( {}^nC_r + {}^{n-1}C_r+ {}^{n-2}C_r.....+...+....+ {}^rC_r \space is : \)