\hspace{-16}\bf{(1)\;\;}$ In how many ways can the letters of the word $"\bf{PERMUTATIONS}"$\\\\ be arranged so that there is always exactly $\bf{4}$ letters between $\bf{P}$ and $\bf{S}$, is\\\\\\ $\bf{(2)\;\;}$ Calculate Total no. of ways of selecting $\bf{p}$ and $\bf{q}$ from $\bf{\left\{1,2,3,.....,9,10\right\}}$\\\\ So that $\bf{\mid p-q\mid <4}.$
-
UP 0 DOWN 0 1 1
1 Answers
2291)-- 7*10!
2)-- if p can be equal to q then 79
And if p≠q then 69
