Home
Class 12
MATHS
The number of words that can be formed u...

The number of words that can be formed using all the letters of the word REGULATIONS such that `G` must come after `R`, `L` must come after `A`, and `S` must come after `N` are

A

`11!//8`

B

`11!`

C

`"^(11)P_(6)`

D

none of these

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem of finding the number of words that can be formed using all the letters of the word "REGULATIONS" under the given constraints, we will follow these steps: ### Step 1: Count the total letters and identify constraints The word "REGULATIONS" consists of 11 letters: R, E, G, U, L, A, T, I, O, N, S. The constraints given are: - G must come after R - L must come after A - S must come after N ### Step 2: Calculate the total arrangements without constraints First, we calculate the total number of arrangements of the letters in "REGULATIONS". Since all letters are unique, the total arrangements are given by the factorial of the number of letters: \[ \text{Total arrangements} = 11! = 39916800 \] ### Step 3: Apply the constraints Now, we need to account for the constraints. Each constraint effectively reduces the number of valid arrangements. 1. **For the constraint G after R**: - In any arrangement of the letters, R and G can be in any order. Since there are two positions for R and G, half of the arrangements will have G after R. - Therefore, the number of arrangements satisfying this condition is: \[ \frac{11!}{2} = \frac{39916800}{2} = 19958400 \] 2. **For the constraint L after A**: - Similarly, for L and A, half of the arrangements will have L after A. So we further divide by 2: \[ \frac{19958400}{2} = 9979200 \] 3. **For the constraint S after N**: - Again, for S and N, half of the arrangements will have S after N. We divide by 2 one more time: \[ \frac{9979200}{2} = 4989600 \] ### Step 4: Final count of valid arrangements Thus, the total number of arrangements of the letters in "REGULATIONS" that satisfy all the given conditions is: \[ \text{Valid arrangements} = 4989600 \] ### Conclusion The number of words that can be formed using all the letters of the word "REGULATIONS" such that G comes after R, L comes after A, and S comes after N is **4989600**.

To solve the problem of finding the number of words that can be formed using all the letters of the word "REGULATIONS" under the given constraints, we will follow these steps: ### Step 1: Count the total letters and identify constraints The word "REGULATIONS" consists of 11 letters: R, E, G, U, L, A, T, I, O, N, S. The constraints given are: - G must come after R - L must come after A - S must come after N ...
Doubtnut Promotions Banner Mobile Dark
|

Topper's Solved these Questions

  • PERMUTATION AND COMBINATION

    CENGAGE ENGLISH|Exercise Multiple Correct Answer|2 Videos
  • PERMUTATION AND COMBINATION

    CENGAGE ENGLISH|Exercise Comprehension|8 Videos
  • PARABOLA

    CENGAGE ENGLISH|Exercise Matching Column Type|1 Videos
  • PRINCIPLE OF MATHEMATICAL INDUCTION

    CENGAGE ENGLISH|Exercise Sovled Examples|22 Videos

Similar Questions

Explore conceptually related problems

Write the number of words that can be formed out of the letters of the word COMMITTEE.

The number of words that can be formed by using the letters of the word 'MATHEMATICS' that start as well as end with T, is

Find the number of words which can be formed using all the letters of the word 'INSTITUTION' which start with consonant.

Write the number of all possible words that can be formed using the letters of the word MATHEMATICS.

Number of words of 4 letters that can be formed with the letters of the word IIT JEE, is

How many different words can be formed by using all the letters of the word ALLAHABAD?

The total number of words that can be formed using all letters of the word 'RITESH' that neither begins with I nor ends with R, is

How many words can be formed using all the letters of the word HEXAGON if repetition is not allowed?

How many different words can be formed by using all the letters of the word 'ALLAHABAD'?

Find the number of words formed by permuting all the letters of the following word: INDIA