A classic counting problem is to determine the number of dif

A classic counting problem is to determine the number of different ways that the letters of \"occurrence\"

can be arranged. Find that number.

The number of different ways that the letters of \"occurrence\" can be arranged is ___________.

Solution

In OCCURRENCE, there are

1 O
3 C
1 U
2 R
2 E
1 N

By permutation of like objects, there are 10 letters here:

P(10; 1,3,1,2,2,1) = 10!/[1!3!1!2!2!1!] = 151200 ways [ANSWER]