Calculate the numbers of ways to arrange 6 letters out of 7 letters of

  • Thread starter Thread starter xender_c
  • Start date Start date
  • Tags Tags
    Numbers
Click For Summary
SUMMARY

The discussion focuses on calculating the number of ways to arrange 6 letters from the 7-letter word "SETTEES," resulting in a total of 210 unique arrangements. The approach involves applying the multinomial theorem and considering the permutations of identical letters. Specifically, the arrangement process includes distinguishing between identical letters and dividing by the factorial of their counts to eliminate equivalent arrangements. The final calculation is based on the permutations of the letters E, S, and T, leading to the conclusion that there are 24 equivalent starting configurations to account for.

PREREQUISITES
  • Understanding of permutations and combinations
  • Familiarity with the multinomial theorem
  • Basic knowledge of factorial notation
  • Ability to distinguish between identical items in arrangements
NEXT STEPS
  • Study the multinomial theorem in detail
  • Practice calculating permutations with identical items
  • Explore advanced combinatorial techniques
  • Learn about factorial functions and their applications in combinatorics
USEFUL FOR

This discussion is beneficial for students and educators in mathematics, particularly those focusing on combinatorics and probability, as well as anyone interested in solving arrangement problems involving identical items.

xender_c
Messages
1
Reaction score
0
Calculate the numbers of ways to arrange 6 letters out of 7 letters of the word `SETTEES'.
Answer:210
Could anyone explain this to me ?thx
 
Physics news on Phys.org


try making different cases, for example 3 alike of 1 kind 2 alike of another kind and 1 of third kind.
or if you have read multinomial theorem try using that.it is simpler.
 


I find it most helpful to go through the mental process of actually choosing an arrangement and counting the choice one makes at each stage. You multiply the numbers for each stage to get the total multiplicity of choices. You then consider if you created any equivalent arrangements and divide those out. Example: Arrangements of two of the letters "ADD".

First I would distinguish the two D's { A, D1, D2}.
There are three letters and I have 3 choices for the first in my arrangement. There are two remaining and I have 2 choices for the 2nd. That's 3 x 2 = 6 choices.

Now since we can't really distinguish D1 vs D2 we divide out the ways we may have multiply chosen the same arrangement.

Of those 6 arrangements starting with any of the 2 permutations of D1 and D2 will give me an identical sequence of choices. So I divide by 2!=2 6/2 = 3.
AD DA and DD.

In your case there are 3!=6 ways to permute the three E's times 2!=2 ways to permute the S's and 2!=2 ways to permute the T's. That's 6x2x2=24 equivalent starting configurations. Figure the way to arrange 6 of 7 distinct letters and then divide by 24.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
2K
Replies
23
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
1
Views
2K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 28 ·
Replies
28
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 17 ·
Replies
17
Views
3K