Question

In how many ways can the letters in the word KINDEST be rearrannged? *A)7P7B)7!C)7C7D)7P1

Answer 1

The number of ways can the letters be rearranged is given by the formula :

`N=(n!)/(a!b!c!\ldots)`

where N is the number of ways

n is the number of letters

a, b and c are the number of duplicate letters

From the problem, KINDEST has 7 letters and it has NO duplicate letters so a, b and c are all equal to 1.

Using the formula above :

`N=(7!)/(1!)=7!`

The answer is B. 7!