Permutations(n₁ alike....)

_nP_r = n! / n₁! n₂!....n_k!

Number of different permutations (order counts) when n items are available and all n are selected without replacement, but some of the items are identical to others: n1 are alike, n2 are alike, . . . nk are alike

Example: How many different ways can the letters of “statistics” be arranged?

Number of objects or in this case, letters.
N = 10

Subsets: S = 3; T = 3; A = 1; I = 2; C = 1;

We do not need the ones

10! / (3! x 3! x 2!)

N

K

Pre-results

_nP_r =

results 2