answersLogoWhite

0

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.

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

How many distinguishable permutations of letters are in the word queue?

three


How many distinguishable permutations can be made out of the word cat?

act


How many distinguishable permutations are there in the word letters?

7 factorial


How many distinguishable permutations of letters are possible in the word class?

120?


What are number of distinguishable permutations in the word Georgia?

2520.


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.


How many permutations are in the word October?

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.


How many distinguishable and indistinguishable permutations are there in the word algrebra?

The word "algrebra" has 8 letters, with the letter 'a' appearing twice and 'r' appearing twice. To find the number of distinguishable permutations, we use the formula for permutations of multiset: ( \frac{n!}{n_1! \times n_2!} ), where ( n ) is the total number of letters and ( n_1, n_2 ) are the frequencies of the repeating letters. Thus, the number of distinguishable permutations is ( \frac{8!}{2! \times 2!} = 10080 ). Since all letters are counted in this formula, there are no indistinguishable permutations in this context.


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


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.


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.


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.