We know the Pascal’s Identity very well, i.e. n c r = n-1 c r + n-1 c r-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, n c r means selecting r elements from n elements. Let us pick a special element k from these n elements, we left with (n – 1) elements.
Read full article from Significance of Pascal’s Identity | GeeksforGeeks
No comments:
Post a Comment