Question

In how many ways the word SCOOTER be arranged when repetition is not allowed.

Answer 1

The number of different permutations of $n$ objects, where there are $n_1$ indistinguishable objects of type 1, $n_2$ indistinguishable objects of type 2, … , and $n_k$ indistinguishable objects of type k, is

$$\dfrac{n!}{n_1!n_2!...n_k!}$$

SCOOTER - 7 letters

$$\dfrac{7!}{2!}=2520$$

 The word SCOOTER can be arranged in2520 ways when repetition is not allowed.