If the n objects in a permutations problem are not all

Last updated: 7/15/2022

If the n objects in a permutations problem are not all distinguishable-that is, if there are n₁ of type 1, n₂ of type 2, and so on, for r different types-then the number of distinguishable permutations is given by n!/n1!n2!....nr! How many permutations are possible using the 6 letters in the word WARSAW? The number of possible permutations is