Simple Applications
Permutation and Combination

119306 Using the letters of the word TRICK a five letter word with distinct letters is formed such that \(C\) is in the middle. In how many ways this is possible?

1 6
2 120
3 24
4 72
Permutation and Combination

119308 Among the statements :
\(\left(\mathbf{S}_1\right): 2023^{2022}-1999^{2022}\) is divisible by 8
\(\left(\mathbf{S}_{\mathbf{2}}\right): 13(13)^{\mathrm{n}}-11 \mathrm{n}-13\) is divisible by 8
Infinitely many \(\mathbf{n} \in \mathbf{N}\).

1 both \(\left(\mathrm{S}_1\right)\) and \(\left(\mathrm{S}_2\right)\) are incorrect
2 only \(\left(\mathrm{S}_2\right)\) is correct
3 both \(\left(\mathrm{S}_1\right)\) and \(\left(\mathrm{S}_2\right)\) are correct
4 only \(\left(\mathrm{S}_1\right)\) is correct
Permutation and Combination

119309 \(\sum_{\mathrm{r}=1}^{20}\left(\mathrm{r}^2+1\right)(\mathrm{r} !)\) is equal to:

1 \(22 !-21\) !
2 \(22 !-2(21 !)\)
3 \(21 !-2(20\) !)
4 \(21 !-20\) !
Permutation and Combination

119310 The number of ways, in which 5 girls and 7 boys can be seated at round table so that no two girls sit together, is

1 \(126(5 !)^2\)
2 \(7(360)^2\)
3 720
4 \(7(720)^2\)
NEET Test Series from KOTA - 10 Papers In MS WORD WhatsApp Here
Permutation and Combination

119306 Using the letters of the word TRICK a five letter word with distinct letters is formed such that \(C\) is in the middle. In how many ways this is possible?

1 6
2 120
3 24
4 72
Permutation and Combination

119308 Among the statements :
\(\left(\mathbf{S}_1\right): 2023^{2022}-1999^{2022}\) is divisible by 8
\(\left(\mathbf{S}_{\mathbf{2}}\right): 13(13)^{\mathrm{n}}-11 \mathrm{n}-13\) is divisible by 8
Infinitely many \(\mathbf{n} \in \mathbf{N}\).

1 both \(\left(\mathrm{S}_1\right)\) and \(\left(\mathrm{S}_2\right)\) are incorrect
2 only \(\left(\mathrm{S}_2\right)\) is correct
3 both \(\left(\mathrm{S}_1\right)\) and \(\left(\mathrm{S}_2\right)\) are correct
4 only \(\left(\mathrm{S}_1\right)\) is correct
Permutation and Combination

119309 \(\sum_{\mathrm{r}=1}^{20}\left(\mathrm{r}^2+1\right)(\mathrm{r} !)\) is equal to:

1 \(22 !-21\) !
2 \(22 !-2(21 !)\)
3 \(21 !-2(20\) !)
4 \(21 !-20\) !
Permutation and Combination

119310 The number of ways, in which 5 girls and 7 boys can be seated at round table so that no two girls sit together, is

1 \(126(5 !)^2\)
2 \(7(360)^2\)
3 720
4 \(7(720)^2\)
Permutation and Combination

119306 Using the letters of the word TRICK a five letter word with distinct letters is formed such that \(C\) is in the middle. In how many ways this is possible?

1 6
2 120
3 24
4 72
Permutation and Combination

119308 Among the statements :
\(\left(\mathbf{S}_1\right): 2023^{2022}-1999^{2022}\) is divisible by 8
\(\left(\mathbf{S}_{\mathbf{2}}\right): 13(13)^{\mathrm{n}}-11 \mathrm{n}-13\) is divisible by 8
Infinitely many \(\mathbf{n} \in \mathbf{N}\).

1 both \(\left(\mathrm{S}_1\right)\) and \(\left(\mathrm{S}_2\right)\) are incorrect
2 only \(\left(\mathrm{S}_2\right)\) is correct
3 both \(\left(\mathrm{S}_1\right)\) and \(\left(\mathrm{S}_2\right)\) are correct
4 only \(\left(\mathrm{S}_1\right)\) is correct
Permutation and Combination

119309 \(\sum_{\mathrm{r}=1}^{20}\left(\mathrm{r}^2+1\right)(\mathrm{r} !)\) is equal to:

1 \(22 !-21\) !
2 \(22 !-2(21 !)\)
3 \(21 !-2(20\) !)
4 \(21 !-20\) !
Permutation and Combination

119310 The number of ways, in which 5 girls and 7 boys can be seated at round table so that no two girls sit together, is

1 \(126(5 !)^2\)
2 \(7(360)^2\)
3 720
4 \(7(720)^2\)
Permutation and Combination

119306 Using the letters of the word TRICK a five letter word with distinct letters is formed such that \(C\) is in the middle. In how many ways this is possible?

1 6
2 120
3 24
4 72
Permutation and Combination

119308 Among the statements :
\(\left(\mathbf{S}_1\right): 2023^{2022}-1999^{2022}\) is divisible by 8
\(\left(\mathbf{S}_{\mathbf{2}}\right): 13(13)^{\mathrm{n}}-11 \mathrm{n}-13\) is divisible by 8
Infinitely many \(\mathbf{n} \in \mathbf{N}\).

1 both \(\left(\mathrm{S}_1\right)\) and \(\left(\mathrm{S}_2\right)\) are incorrect
2 only \(\left(\mathrm{S}_2\right)\) is correct
3 both \(\left(\mathrm{S}_1\right)\) and \(\left(\mathrm{S}_2\right)\) are correct
4 only \(\left(\mathrm{S}_1\right)\) is correct
Permutation and Combination

119309 \(\sum_{\mathrm{r}=1}^{20}\left(\mathrm{r}^2+1\right)(\mathrm{r} !)\) is equal to:

1 \(22 !-21\) !
2 \(22 !-2(21 !)\)
3 \(21 !-2(20\) !)
4 \(21 !-20\) !
Permutation and Combination

119310 The number of ways, in which 5 girls and 7 boys can be seated at round table so that no two girls sit together, is

1 \(126(5 !)^2\)
2 \(7(360)^2\)
3 720
4 \(7(720)^2\)