0
Find the number of distinguishable permutations of the letters in the word Cincinnati?
Wiki User
∙ 13y ago
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,800
But 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 of
times each distinguishable permutation occurs with different and indisnguishable arrangements
of '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.
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
Find the number of distinguishable permutations of letters in the word appliance?
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
Find the number of distinguishable permutations of the letters in the word manatee?
Take the total number of letters factorial, then divide by the multiple letters factorial (a and e). 7! / (2!*2!) or 1260.
What is the number of distinguishable permutation of the letters in the word September?
September has 9 letter, of which one appears 3 times. So the number of distinct permutations is 9!/3! = 120,960
Find the number of distinguishable permutations of the letters in the word calculator?
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.
How do you find permutation?
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)!
What is the number of distinguishable permutations of the letters in the word GLASSES?
The solution is count the number of letters in the word and divide by the number of permutations of the repeated letters; 7!/3! = 840.
What is the number of permutations of the letters in Cincinnati?
not sure
In how many ways can all the letters in the word mathematics be arranged in distinguishable permutations?
The word mathematics has 11 letters; 2 are m, a, t. The number of distinguishable permutations is 11!/(2!2!2!) = 39916800/8 = 4989600.
What is the number of distinguishable permutations of the letters in the word oregon?
360. There are 6 letters, so there are 6! (=720) different permutations of 6 letters. However, since the two 'o's are indistinguishable, it is necessary to divide the total number of permutations by the number of permutations of the letter 'o's - 2! = 2 Thus 6! ÷ 2! = 360
Find the number of distinguishable permutations of letters in the word appliance?
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
How many distinguishable permutations are there of the letters in the word effective?
The number of permutations of the letters EFFECTIVE is 9 factorial or 362,880. To determine the distinct permutations, you have to compensate for the three E's (divide by 4) and the two F's (divide by 2), giving you 45,360.
What is the number of distinguishable permutations?
The formula for finding the number of distinguishable permutations is: N! -------------------- (n1!)(n2!)...(nk!) where N is the amount of objects, k of which are unique.
Find the number of distinguishable permutations of the letters honest?
It is 6! = 6*5*4*3*2*1 = 720
Find the number of distinguishable permutations of the letters in the word manatee?
Take the total number of letters factorial, then divide by the multiple letters factorial (a and e). 7! / (2!*2!) or 1260.
What are number of distinguishable permutations in the word Georgia?
2520.
How may distinguishable permutations are possible with all the letters of the word ellises?
We can clearly observe that the word "ellises" has 7 letters and three pairs of letters are getting repeated that are 'e','l' and 's'. So, Number of distinguishable permutations = 7!/(2!2!2!) = 7 x 6 x 5 x 3 = 630.
What is the number of distinguishable permutations of the letters in the word EFFECTIVE?
The number of permutations of the letters EFFECTIVE is 9 factorial or 362,880. Since the letter E is repeated twice we need to divide that by 4, to get 90,720. Since the letter F is repeated once we need to divide that by 2, to get 45,360.
