If
\(\sum\limits_{k=1}^{31}\) \((^{31}C_k) (^{31}C_{k-1})\) \(-\sum\limits_{k=1}^{30}\) \((^{30}C_k) (^{30}C_{k-1})\) \(= \frac{α (60!)} {(30!) (31!)}\)
where \(α ∈ R\), then the value of 16α is equal to
The correct answer is (A) : 1411
\(\sum\limits_{k=1}^{31}\)\((^{31}C_k) (^{31}C_{k-1})\) \(-\sum\limits_{k=1}^{30}\) \((^{30}C_k) (^{30}C_{k-1})\)
\(=\sum\limits_{k=1}^{31}\) \((^{31}C_k) . (^{31}C_{32-k})\) \(-\sum\limits_{k=1}^{30}\) \((^{30}C_k) . (^{30}C_{k-1})\)
\(= ^{62}C_{32} - ^{60}C_{31}\)
\(= \frac{60!}{31!29!} ( \frac{62.61}{32.30} - 1 ) = \frac{60!}{ 31!29!} \frac{2822}{32.30}\)
\(α = \frac{2822}{32}\)
\(⇒ 16α = 1411\)
How many possible words can be created from the letters R, A, N, D (with repetition)?
Permutation is the method or the act of arranging members of a set into an order or a sequence.
Combination is the method of forming subsets by selecting data from a larger set in a way that the selection order does not matter.