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)

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

If 1<=r<=n, then n^(n-1)C_(r)=(n-r+1)^(n)C_(r-1)

The combinatorial coefficient C(n, r) is equal to

Prove that ""^(n)C_(r ) ""^(r ) C_(s)= ""^(n)C_(s) ""^(n-s)C_(r-s)

Let n and r be no negative integers suych that r<=n. Then,^(n)C_(r)+^(n)C_(r-1)=^(n+1)C_(r)

Let n and r be non negative integers such that 1<=r<=n* Then,^(n)C_(r)=(n)/(r)*^(n-1)C_(r-1)

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