Permutations of the word SUPERSTITIOUS

  • Thread starter Thread starter Lainababe
  • Start date Start date
  • Tags Tags
    Permutations
Click For Summary
SUMMARY

The discussion focuses on calculating the permutations of the letters in the word "SUPERSTITIOUS" under specific conditions. For part (a), the correct approach involves treating the pair "ST" as a single unit, leading to the formula 11!/2!2! for the total arrangements, accounting for the indistinguishable letters. For part (b), the challenge lies in determining the placement of the letter R between the two T's, which requires careful consideration of the arrangement rules and the multiplicities of the letters involved.

PREREQUISITES
  • Understanding of factorial notation and permutations
  • Familiarity with combinatorial principles, including the quotient rule
  • Knowledge of handling indistinguishable objects in permutations
  • Basic grasp of the concept of treating groups of letters as single units
NEXT STEPS
  • Study the principles of permutations with restrictions in combinatorics
  • Learn about the multinomial coefficient for arrangements of indistinguishable objects
  • Explore advanced permutation problems involving conditional placements
  • Investigate the application of the inclusion-exclusion principle in combinatorial counting
USEFUL FOR

Students studying combinatorics, educators teaching permutation concepts, and anyone interested in solving complex arrangement problems in mathematics.

Lainababe
Messages
1
Reaction score
0

Homework Statement



How many ways are there to rearrange the letters of the word “SUPERSTITIOUS” so that...
(a) ...each T is immediately preceded by an S?
For example, “STUERSTIPIOUS” has this property, while “SUPERSTITIOUS” does not.
(b) ...the R appears between the two Ts?
For example, “SUTERSPITIOUS” has this property, while “SUPERSTITIOUS” does not.


Homework Equations


I am having trouble figuring out which permutations to exclude and include, and was wondering what the rules would be on using the quotient rule to divide out unnecessary permutations.

The Attempt at a Solution


For (a) I know that there are 13! ways total with each letter being distinct. I think that I need to divide 13! by 2!2! because there's two groups where the switching of the letters doesn't matter, but I am not entirely sure. I also think that I need to divide out other non-distinct permutations, such as the identical 'i's, So my conclusion was that there will be 11!/2!2!2! ways.

For (b) I'm stuck. I know that there are 13! total ways with each letter being distinct, I know that i need to divide by each letters' mulitplicities, etc. I am very unsure about the combinations of the placements of the T's and R's though. Any ideas would be great!

Note: I don't want an answer. I kinda just want pushed in the right direction. =)
 
Physics news on Phys.org
The concept for having letters always following another letter is to say that T and S are one letter. So you would have ST, ST, S, I, I, O, U, U, R, E, P. You have to be careful though, I'm not sure if the fact that there is another S in the mix that you could switch in and our the different S's and make more permutations. double check that but I don't think you need to take that into account. so you would have 11!/(2!*2!) since only the I's and U's are recurring.

and for b) do you mean that the R can be anywhere between the two T's, or just sandwhiched right between like TRT.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 23 ·
Replies
23
Views
4K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 60 ·
3
Replies
60
Views
9K