\(\sum_{\substack{i,j=0 \\ t \neq j}}^n\) \(^nC_i\ ^nC_j \)
is equal to
\(2^{2n \text\_2n}C_n\)
\(2^{2n-1\_2n-1}C_{n-1}\)
\(2^{2n-\frac{1}{2}}\ ^{2n}C_n\)
\(2^{n-1}+2^{2n-1}C_n\)
The correct answer is (A) : \(2^{2n \text\_2n}C_n\)
\(\sum_{\substack{i,j=0 \\ t \neq j}}^n\) \(^nC_i\ ^nC_j \)
\(= ∑^{n}_{i,j = 0}\) \(^nC_i\ ^nC_j - ∑^{n}_{i=j}\ ^nC_i\ ^nC_j\)
\(= ∑^{n}_{j=0}\ ^nC_i ∑^{n}_{j =0}\ ^nC_j - ∑^{n}_{ i =0}\ ^nC_i\ Ci\)
\(= 2^n.2^n-\ ^{2n}C_n\)
\(= 2^{2n\_2n}C_n\)
The method of forming subsets by selecting data from a larger set in a way that the selection order does not matter is called the combination.
But you are only allowed to pick three.
It is used for a group of data (where the order of data doesn’t matter).