How many words can be formed from the word SUCCESS without any repeated letters?

  • Context: MHB 
  • Thread starter Thread starter juantheron
  • Start date Start date
Click For Summary
SUMMARY

The total number of distinct arrangements of the word "SUCCESS" without any two 'C's or 'S's being adjacent is 96. This is derived from the total arrangements of the letters, calculated as 420, minus the arrangements where two 'C's are together (120) and where two 'S's are together (120). The final calculation incorporates the scenario where both pairs of letters are restricted, resulting in 24 arrangements. The formulae used include factorial calculations and combinations to arrive at these figures.

PREREQUISITES
  • Understanding of permutations and combinations
  • Familiarity with factorial notation
  • Basic knowledge of combinatorial principles
  • Ability to manipulate binomial coefficients
NEXT STEPS
  • Study advanced combinatorial techniques in discrete mathematics
  • Learn about the principles of inclusion-exclusion in counting
  • Explore permutations of multiset arrangements
  • Practice problems involving restrictions in arrangements
USEFUL FOR

Students of combinatorics, mathematicians, and anyone interested in solving problems related to permutations and arrangements with restrictions.

juantheron
Messages
243
Reaction score
1
how many number of words are formed from word $\bf{SUCCESS}$ such that no two $\bf{C}$ and no two $\bf{S}$ are together

My Trial:: First we will count Total no. of arrangement of words without restriction.

which is $\displaystyle = \frac{7!}{3!\times 2!} = 420$

Now Total no. of arrangement in which two $\bf{C}$ are together

which is $\displaystyle = \frac{6!}{3!} = 120$

Now Total no. of words in which no two $\bf{S}$ are togrther, is $\displaystyle = \binom{5}{3}\times \frac{4!}{2!} = 120$

Now I did understand How can i Calculate after that

So Help please

Thanks
 
Physics news on Phys.org
jacks said:
Now Total no. of words in which no two $\bf{S}$ are togrther, is $\displaystyle = \binom{5}{3}\times \frac{4!}{2!} = 120$
Subtract from that the number of words where no two S's are together, but both C's are together.
 
Thanks Evgeny.Makarov, Using your Hint:

Total no. of words in which two $\bf{S}$ are not together and two $\bf{C}$ are together

$ \displaystyle = \binom{4}{3}\times 3! = 24$

Now Total no. of words in which no two $\bf{C}$ and no two $\bf{S}$ are together , is $ = 120-24 = 96$

Got it.

Thanks
 
Last edited:

Similar threads

Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
12
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 22 ·
Replies
22
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K