How do you find the number of distinguishable permutations of

gledanju0

gledanju0

Answered question

2022-06-24

How do you find the number of distinguishable permutations of the group of letters: A, A, G, E, E, E, M?

Answer & Explanation

Christina Ward

Christina Ward

Beginner2022-06-25Added 19 answers

Step 1
Given: A, A, G, E, E, E, M
For the sake of discussion, let's distinguish all of the letters by adding subscripts:
A 1 , A 2 , G , E 1 , E 2 , E 3 , M
The number of distinguishable permutations of these marked letters is:
7 ! = 7 6 5 4 3 2 1 = 5040
Step 2
If we now remove the marking, then some of these distinguishable permutations become indistinguishable.
In fact, each of the previously distinguishable arrangements has a total of 2 ! 3 ! = 12 variants, now indistinguishable.
So the total number of distinguishable permutations is:
7 ! 2 ! 3 ! = 5040 2 6 = 420

Do you have a similar question?

Recalculate according to your conditions!

New Questions in High school probability

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?