Let $n(A) = 3, \,n(B) = 3$ (where $n(S)$ denotes number of elements in set $S$), then number of subsets of $(A \times B)$ having odd number of elements, is-
Let $n(A) = 3, \,n(B) = 3$ (where $n(S)$ denotes number of elements in set $S$), then number of subsets of $(A \times B)$ having odd number of elements, is-
- A
$64$
- B
$128$
- C
$256$
- D
$512$
Similar Questions
If $^{2017}C_0 + ^{2017}C_1 + ^{2017}C_2+......+ ^{2017}C_{1008} = \lambda ^2 (\lambda > 0),$ then remainder when $\lambda $ is divided by $33$ is-
If $^{2017}C_0 + ^{2017}C_1 + ^{2017}C_2+......+ ^{2017}C_{1008} = \lambda ^2 (\lambda > 0),$ then remainder when $\lambda $ is divided by $33$ is-
A committee of $11$ members is to be formed from $8$ males and $5$ females. If $m$ is the number of ways the committee is formed with at least $6$ males and $n$ is the number of ways the committee is formed with at least $3$ females, then
A committee of $11$ members is to be formed from $8$ males and $5$ females. If $m$ is the number of ways the committee is formed with at least $6$ males and $n$ is the number of ways the committee is formed with at least $3$ females, then
- [JEE MAIN 2019]
In how many ways can a girl and a boy be selected from a group of $15$ boys and $8 $ girls
In how many ways can a girl and a boy be selected from a group of $15$ boys and $8 $ girls
The value of $\sum\limits_{r = 0}^{n - 1} {\frac{{^n{C_r}}}{{^n{C_r} + {\,^n}{C_{r + 1}}}}} $ equals
The value of $\sum\limits_{r = 0}^{n - 1} {\frac{{^n{C_r}}}{{^n{C_r} + {\,^n}{C_{r + 1}}}}} $ equals
In how many ways can $6$ persons be selected from $4$ officers and $8$ constables, if at least one officer is to be included
In how many ways can $6$ persons be selected from $4$ officers and $8$ constables, if at least one officer is to be included