We know the Pascal’s Identity very well, i.e. ncr = n-1cr + n-1cr-1
A curious reader might have observed that Pascal’s Identity is instrumental in establishing recursive relation in solving binomial coefficients. It is quite easy to prove the above identity using simple algebra. Here I’m trying to explain it’s practical significance.
Recap from counting techniques, ncr means selecting r elements from n elements. Let us pick a special element k from these n elements, we left with (n – 1) elements.
We can group these r elements selection ncr into two categories,
1) group that contains the element k.
2) group that does not contain the element k.
Consider first group, the special element k is in all r selections. Since k is part of r elements, we need to choose (r – 1) elements from remaining (n – 1) elements, there are n-1cr-1 ways.
Consider second group, the special element k is not there in all r selections, i.e. we will have to select all the r elements from available (n – 1) elements (as we must exclude element k from n). This can be done in n-1cr ways.
Now it is evident that sum of these two is selecting r elements from n elements.
There can be many ways to prove the above fact. There might be many applications of Pascal’s Identity. Please share your knowledge.
— Venki. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Cassini’s Identity
- Program for Identity Matrix
- Euler's Four Square Identity
- Brahmagupta Fibonacci Identity
- Proizvolov's Identity
- Find all the possible remainders when N is divided by all positive integers from 1 to N+1
- Count of primes below N which can be expressed as the sum of two primes
- Find the centroid of a non-self-intersecting closed Polygon
- Find N in the given matrix that follows a pattern
- Minimum cells to be flipped to get a 2*2 submatrix with equal elements
- Print all palindrome dates between the given years
- Find the sum of the costs of all possible arrangements of the cells
- Find an integer in the given range that satisfies the given conditions
- Minimum cost to partition the given binary string