Permutations with possibly repeating letters

  • Thread starter Thread starter poonintoon
  • Start date Start date
  • Tags Tags
    permutations
AI Thread Summary
The discussion revolves around calculating the number of distinct three-letter words formed from the letters A, B, C, D, and E, where E can appear 0, 1, or 2 times, while the other letters can only appear once. A participant expresses confusion over the application of permutation formulas, particularly regarding how combinations with one E and two Es overlap. It is clarified that the calculation for 60 combinations includes scenarios with 0 or 1 E, and that the formula 6!/(2!3!) does not account for all permutations involving ABE. The conversation suggests breaking down the cases of E's occurrences separately to enhance understanding. Ultimately, the key takeaway is the need to clarify how different cases of E's presence affect the total count of distinct permutations.
poonintoon
Messages
17
Reaction score
0

Homework Statement


Find the number of distinct three letter words obtainable from the letters A,B,C,D,E in which E may occur 0, 1 or 2 times but the rest may occur only once.

Homework Equations


Number of combinations when picking r objects from n possibly objects in which one object is repeated m times
N = n! / (m! (n-r)!

The Attempt at a Solution


I have never had a good instinct for permutations, I can plug in a formula to answer basic questions but never had a good enough understanding for it to solve more advanced problems (This is why I have dug out my old maths textbook to try and correct this )

One thing that is especially confusing for me is this.
With one E there are 5P3 = 5!/2! = 60 combinations (but this already includes ABC, ABD, ... etc i.e. all of the possible combinations with zero E's ?).
If I found the number of permutations for 3 letter words with 2E's [6!/(2!3!)] shouldn't this also include ABE etc i.e. all the permutations with 1E? Yet the answer is 60 so clearly it doesn't. I think if I could resolve my misunderstanding if this part the fog would lift for me.

Please let me know if anything is unclear and I will make some edits
 
Physics news on Phys.org
poonintoon said:

Homework Statement


Find the number of distinct three letter words obtainable from the letters A,B,C,D,E in which E may occur 0, 1 or 2 times but the rest may occur only once.

Homework Equations


Number of combinations when picking r objects from n possibly objects in which one object is repeated m times
N = n! / (m! (n-r)!

The Attempt at a Solution


I have never had a good instinct for permutations, I can plug in a formula to answer basic questions but never had a good enough understanding for it to solve more advanced problems (This is why I have dug out my old maths textbook to try and correct this )

One thing that is especially confusing for me is this.
With one E there are 5P3 = 5!/2! = 60 combinations (but this already includes ABC, ABD, ... etc i.e. all of the possible combinations with zero E's ?).
If I found the number of permutations for 3 letter words with 2E's [6!/(2!3!)] shouldn't this also include ABE etc i.e. all the permutations with 1E? Yet the answer is 60 so clearly it doesn't. I think if I could resolve my misunderstanding if this part the fog would lift for me.

Please let me know if anything is unclear and I will make some edits

To build your understanding, I suggest you try this problem without using the combination or permutation formulas. Try to count them more directly and find your own shortcuts.

Hint: Calculate separately the cases of 0, 1 or 2 E's.
 
poonintoon said:
60 combinations (but this already includes ABC, ABD, ... etc i.e. all of the possible combinations with zero E's ?).
Yes. 0 or 1 Es can be handled together because that makes E behave the same as the other letters.
poonintoon said:
If I found the number of permutations for 3 letter words with 2E's [6!/(2!3!)]
Exactly 2 Es? I make it rather less.
poonintoon said:
shouldn't this also include ABE etc
I think you are asking whether the way you arrived at 6!/(2!3!) includes ABE etc. I cannot tell since you do not explain it.
 
haruspex said:
Yes. 0 or 1 Es can be handled together because that makes E behave the same as the other letters.

Exactly 2 Es? I make it rather less.

I think you are asking whether the way you arrived at 6!/(2!3!) includes ABE etc. I cannot tell since you do not explain it.
Thank you, yes you have understood me correctly! That is my question. I thought that 6!/(2!3!) was basically equivalent to finding distinct permutations of ABCDEE (which would include ABE etc but clearly not). What does 6!/(2!3!) tell you the number of?
 
poonintoon said:
Thank you, yes you have understood me correctly! That is my question. I thought that 6!/(2!3!) was basically equivalent to finding distinct permutations of ABCDEE (which would include ABE etc but clearly not). What does 6!/(2!3!) tell you the number of?
You correctly found 60 with 0 or 1 Es. 6!/3! (=120) would count words with up to 2 Es if we regarded the 2 Es as distinct. You divided by 2 because the 2 Es are interchangeable. That gives you the number with exactly 2 Es plus half the number with 0 or 1 Es (totalling 60 again). So... how many have exactly 2 Es?
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...
Back
Top