The distinguishable permutations are the total permutations divided by the product of the factorial of the count of each letter. So:
9!/(2!*2!*1*1*1*1*1) = 362880/4 = 90,720
Chat with our AI personalities
Take the total number of letters factorial, then divide by the multiple letters factorial (a and e). 7! / (2!*2!) or 1260.
September has 9 letter, of which one appears 3 times. So the number of distinct permutations is 9!/3! = 120,960
There are ten letters in the word. The total number of possible permutations is(10) x (9) x (8) x (7) x (6) x (5) x (4) x (3) x (2) = 3,628,800But the two 'c's can be arranged in either of 2 ways with no distinguishable change.Also, the three 'i's can be arranged in any of (3 x 2) = 6 ways with no distinguishable change.And the three 't's can be arranged in any of (3 x 2) = 6 ways with no distinguishable change.So the total number of possible permutations can be divided by (2 x 6 x 6) = 72, the number oftimes each distinguishable permutation occurs with different and indisnguishable arrangementsof 'c', 'i', and 't'.We're left with(10) x (9) x (8) x (7) x (...) x (5) x (...) x (...) x (2) = (3,628,800/72) = 50,400 distinguishable arrangements.
Total permutations 10! ie factorial 10 = 10 x 9 x 8 x 7 x 6 x 5 x 4 x 3 x 2 = 3628800. The 2 "c"s are interchangeable which halves this figure to 1814400, similarly the "a"s and "l"s are interchangeable which reduces by half twice more, ie to 907200 and then to 453600.
If there are n objects and you have to choose r objects then the number of permutations is (n!)/((n-r)!). For circular permutations if you have n objects then the number of circular permutations is (n-1)!