The combinatorial coefficient C(n, r) can not be equal to the (A) number of possible subsets of...

95 views · Published 11 October 2018 · 3:55 · Indexed 22 September 2026

Channel: Doubtnut · 2018 · Education

Watch on YouTube

To ask Unlimited Maths doubts download Doubtnut from - https://goo.gl/9WZjCW The combinatorial coefficient C(n, r) can not be equal to the (A) number of possible subsets of r members from a set of n distinct members. (B) number of possible binary messages of length n with exactly r 1's. (C) number of non decreasing 2-D paths from the lattice point (0,0) to (r, n) (D) number selecting r things out of n different things when a particular thing is always included plus of ways of the number of ways of selecting r things out of n, when a particular thing is always excluded.

More from this channel