Home
Class 12
MATHS
The number of arrangements that can be m...

The number of arrangements that can be made out of the letters of the word SUCCESS so that all S do not come together is

A

60

B

120

C

360

D

420

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem of finding the number of arrangements of the letters in the word "SUCCESS" such that not all 'S' letters come together, we can follow these steps: ### Step 1: Calculate the Total Arrangements First, we need to find the total number of arrangements of the letters in the word "SUCCESS". The word "SUCCESS" has 7 letters in total: - S appears 3 times, - C appears 2 times, - U appears 1 time, - E appears 1 time. The formula for the total arrangements of letters when there are repetitions is given by: \[ \text{Total arrangements} = \frac{n!}{p_1! \times p_2! \times \ldots \times p_k!} \] Where \( n \) is the total number of letters, and \( p_1, p_2, \ldots, p_k \) are the frequencies of the repeated letters. Thus, we have: \[ \text{Total arrangements} = \frac{7!}{3! \times 2! \times 1! \times 1!} \] Calculating this: \[ 7! = 5040 \] \[ 3! = 6, \quad 2! = 2, \quad 1! = 1 \] Now substituting these values into the formula: \[ \text{Total arrangements} = \frac{5040}{6 \times 2 \times 1 \times 1} = \frac{5040}{12} = 420 \] ### Step 2: Calculate the Arrangements with All 'S' Together Next, we need to calculate the arrangements where all 'S' letters come together. We can treat the three 'S' letters as a single unit/block. So, we can represent the letters as follows: - Block of 'SSS', C, C, U, E This gives us a total of 5 units to arrange: - SSS, C, C, U, E Now, we can calculate the arrangements of these 5 units: \[ \text{Arrangements with S together} = \frac{5!}{2!} \] Calculating this: \[ 5! = 120, \quad 2! = 2 \] Thus, \[ \text{Arrangements with S together} = \frac{120}{2} = 60 \] ### Step 3: Calculate the Arrangements with 'S' Not Together Finally, to find the arrangements where not all 'S' letters are together, we subtract the arrangements where all 'S' are together from the total arrangements: \[ \text{Arrangements with S not together} = \text{Total arrangements} - \text{Arrangements with S together} \] Substituting the values we calculated: \[ \text{Arrangements with S not together} = 420 - 60 = 360 \] ### Final Answer The number of arrangements of the letters of the word "SUCCESS" such that not all 'S' letters come together is **360**. ---
Promotional Banner

Topper's Solved these Questions

  • PERMUTATIONS AND COMBINATIONS

    ML KHANNA|Exercise SET -2 FILL IN THE BLANKS|8 Videos
  • PERMUTATIONS AND COMBINATIONS

    ML KHANNA|Exercise SET-3 |41 Videos
  • PERMUTATIONS AND COMBINATIONS

    ML KHANNA|Exercise SET -1 FILL IN THE BLANKS |1 Videos
  • PARTIAL FRACTION

    ML KHANNA|Exercise PROBLEM SET-1 (FILL IN THE BLANKS)|8 Videos
  • PROBABILITY

    ML KHANNA|Exercise MISCELLANEOUS EXERCISE|6 Videos

Similar Questions

Explore conceptually related problems

The number of arrangements which can be made out of the letters of the word ALGEBRA so that no two vowels together is

The number of arrangements that can be made with the letters of the word 'MATHEMATICS' in which all vowels comes together, is

The number of arrangements that can be formed by taking all the letters of the word ENGINEERING so that all Ns come together and Es not come together is

How many arrangements can be made out of the letters of the word 'ENGINEERING'?

The number of permutations that can be made out of the letters of the word "MATHEMATICS when all the vowels come together is 1) 8!. 4! 2) 7! 4! 3) P(8,8).P(4,4)

Find the number of arrangements of the letters of the word PARAL.LEL so that all Ls do not come together but all As come together.

Find the number of different 8 -letter arrangements that can be made from the letters of the word DAUGHTER so that (i) all vowels occur together (ii) all vowels do not occur together.

Find the number of seen letter words that can be formed by using the letters of the word SUCCESS so that the two C are together but no two S are together.

The number of permutations that can be made out of the letters of the word ENTRANCE so that the two 'N' are always together is

ML KHANNA-PERMUTATIONS AND COMBINATIONS -SET-2 MCQ
  1. The number of different words (eight-letter words) ending and beginnin...

    Text Solution

    |

  2. The number of different words can be formed from the letters of the wo...

    Text Solution

    |

  3. The number of arrangements that can be made out of the letters of the ...

    Text Solution

    |

  4. All the letters of the word EAMCET are arranged in all possible ways. ...

    Text Solution

    |

  5. The number of arrangements of the letters of the word BANANA in whi...

    Text Solution

    |

  6. The number of ways in which the letters of the word VOWEL can be arran...

    Text Solution

    |

  7. The number of ways in which the letters of the word FRACTION be arrang...

    Text Solution

    |

  8. The number of words which can be formed out of the letters of the word...

    Text Solution

    |

  9. Number of ways in which the letters of word GARDEN can be arranged wit...

    Text Solution

    |

  10. In how many ways can the letters of the word STRANGE be arranf...

    Text Solution

    |

  11. The number of words which can be formed out of the letters a,b,c,d,e,f...

    Text Solution

    |

  12. The different letters of the alphabet are given, Out of which five let...

    Text Solution

    |

  13. Let A be a set containing 10 distinct elements, then the total number ...

    Text Solution

    |

  14. Total number of words formed by 2 vowels and 3 consonants taken from 4...

    Text Solution

    |

  15. The number of six letter words that can be formed using the letters of...

    Text Solution

    |

  16. We are required to form different words with the help of letter of the...

    Text Solution

    |

  17. the total number of arrangements which can be made out of the letters ...

    Text Solution

    |

  18. The number of ways in which any four letters can be selected out of th...

    Text Solution

    |

  19. The total number of arrangements of the letters in the expression x^3 ...

    Text Solution

    |

  20. The number of seven digit integers with sum of the digits equal to 10 ...

    Text Solution

    |