👤

5. Using the letters in SAMPALOC LAKE, how many distinguishable permutations are there?​

Sagot :

Answer:

39,916,800

Step-by-step explanation:

To find the number of distinguishable permutations, take the total number of letters factorial divide by the frequency of each letter factorial. Basically, the little n's are the frequencies of each different (distinguishable) letter. Big N is the total number of letters.

SAMPALOC LAKE= 12!

A=3!

L=2!

P=12!/3!*2!

P=39,916,800