If $^n{P_r} = 840,{\,^n}{C_r} = 35,$ then $n$ is equal to
If $^n{P_r} = 840,{\,^n}{C_r} = 35,$ then $n$ is equal to
- A
$1$
- B
$3$
- C
$5$
- D
$7$
Similar Questions
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-
The total number of different combinations of one or more letters which can be made from the letters of the word ‘$MISSISSIPPI$’ is
The total number of different combinations of one or more letters which can be made from the letters of the word ‘$MISSISSIPPI$’ is
The number of ordered pairs ( $\mathrm{r}, \mathrm{k}$ ) for which $6 \cdot ^{35} \mathrm{C}_{\mathrm{r}}=\left(\mathrm{k}^{2}-3\right)\cdot{^{36} \mathrm{C}_{\mathrm{r}+1}}$. where $\mathrm{k}$ is an integer, is
The number of ordered pairs ( $\mathrm{r}, \mathrm{k}$ ) for which $6 \cdot ^{35} \mathrm{C}_{\mathrm{r}}=\left(\mathrm{k}^{2}-3\right)\cdot{^{36} \mathrm{C}_{\mathrm{r}+1}}$. where $\mathrm{k}$ is an integer, is
- [JEE MAIN 2020]
A country has ten smart cities. The government decides to connect all these cities by road. How many roads the government need to construct so that every city is connected to every other city ?
A country has ten smart cities. The government decides to connect all these cities by road. How many roads the government need to construct so that every city is connected to every other city ?
The number of ways in which $3$ children can distribute $10$ tickets out of $15$ consecutively numbered tickets themselves such that they get consecutive blocks of $5, 3$ and $2$ tickets is
The number of ways in which $3$ children can distribute $10$ tickets out of $15$ consecutively numbered tickets themselves such that they get consecutive blocks of $5, 3$ and $2$ tickets is