Duration: 4:08

10 views

0

The combinatorial coefficient \( \mathrm{C}(\mathrm{n}, \mathrm{r}) \) is equal to
(A) number of possible subsets of \( r \) members from a set of \( n \) distinct members.
\( \mathrm{P} \)
(B) number of possible binary messages of length \( \mathrm{n} \) with exactly \( r \) l's.
(C) number of non decreasing 2-D paths from the lattice point \( (0,0) \) to \( (r, n) \).
W
(D) number of ways of selecting \( r \) things out of \( n \) different things when a particular thing is always included plus the number of ways of selecting ' \( r \) ' things out of \( n \), when a particular thing is always excluded.
📲PW App Link - https://bit.ly/YTAI_PWAP
🌐PW Website - https://www.pw.live