Home
Class 12
MATHS
Prove that combinatorial argument that ^...

Prove that combinatorial argument that `^n+1C_r=^n C_r+^n C_(r-1)dot`

Text Solution

Verified by Experts

Consider n+1 different toys Then,
(no. of ways of selecting r toys out of (n+1) different toys)
(no. of ways of selecting r toys out of (n+1) different toys)
=(no. of ways of selecting r toys when `T_(0)` is always included)
+ (no. of ways of selecting r toys when `T_(0)` is always excluded)
`=""^(n)C_(r-1)+ ""^(n)C_(r )`
Hence, `""^(n+1)C_(r )= ""^(n)C_(r-1)+ ""^(n)C_(r )`.
Promotional Banner

Similar Questions

Explore conceptually related problems

Prove by combinatorial argument that .^(n+1)C_r=^n C_r+^n C_(r-1)dot

Prove that .^nP_r = ^(n-1)P_r + r^(n-1)P_(r-1)

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

If 2lerlen show that ^nC_r +2 ^nC_(r-1) +^nC_(r-2)=^(n+2)C_r

Prove that "^n C_r+^(n-1)C_r+...+^r C_r=^(n+1)C_(r+1) .

The result of ^(n-1)C_r+^(n-1)C_(r-1)=

Show that , .^(n)C_(r)=(n-r+1)/(r).^(n)C_(r-1) .

The value of determinant |[ ^n C_(r-1), ^n C_r, (r+1)^(n+2)C_(r+1)],[ ^n C_r, ^n C_(r+1),(r+2)^(n+2)C_(r+2)],[ ^n C_(r+1), ^n C_(r+2), (r+3)^(n+2)C_(r+3)]| is n^2+n-2 b. 0 c. ^n+3C_(r+3) d. ^n C_(r-1)+^n C_r+^n C_(r+1)

show that ^nC_r+ ^(n-1)C_(r-1)+ ^(n-1)C_(r-2)= ^(n+1)C_r

Prove that sum_(r=0)^ssum_(s=1)^n^n C_s^s C_r=3^n-1.