Want this question answered?
If the first and second C are indistinguishable, then there are 554,400 permutations. If one is upper case and the other is lower case, then there are twice as many.
There are 7 factorial, or 5,040 permutations of the letters of ALGEBRA. However, only 2,520 of them are distinguishable because of the duplicate A's.
three
7 factorial
There are 7 factorial, or 5,040 permutations of the letters of OCTOBER. However, only 2,520 of them are distinguishable because of the duplicate O's.
If the first and second C are indistinguishable, then there are 554,400 permutations. If one is upper case and the other is lower case, then there are twice as many.
cat
There are 7 factorial, or 5,040 permutations of the letters of ALGEBRA. However, only 2,520 of them are distinguishable because of the duplicate A's.
act
three
7 factorial
120?
There are 7 factorial, or 5,040 permutations of the letters of OCTOBER. However, only 2,520 of them are distinguishable because of the duplicate O's.
The word mathematics has 11 letters; 2 are m, a, t. The number of distinguishable permutations is 11!/(2!2!2!) = 39916800/8 = 4989600.
There are 1816 ways.
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.
Normally, there would be 5!=120 different permutations* of five letters. Since two of the letters are the same, we can each of these permutations will be duplicated once (with the matching letters switched). So there are only half as many, or 60 permutations.* (the correct terminology is "permutation". "combination" means something else.)