SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 6 Q4

If the different permutations of all the letter of the word \(EXAMINATION\) are listed as in a dictionary, how many words are there in this list before the first word starting with \(E\ ?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have the letters from the word EXAMINATION and you arrange them into every possible word, then sort those words like a dictionary. The letter A comes before E in the alphabet. So all words starting with A show up earlier in the list than any word starting with E. We just need to count how many words can be made using the remaining letters after placing A at the front. Some letters repeat, so we divide to avoid counting the same arrangement twice. That count turns out to be 907200.

Answer: There are \( 907200 \) words in the list before the first word starting with E.

📖 Words Before the First Word Starting with E in EXAMINATION

Detailed Explanation

When permutations of a word are arranged like in a dictionary, they are ordered alphabetically. To find how many words come BEFORE the first word beginning with a particular letter, we count all words that start with letters coming earlier in the alphabet. The word EXAMINATION has letters that repeat, so we use the formula for permutations of objects when some are identical. First, list the letters and note repetitions. The letters of EXAMINATION are: A, A, E, I, I, M, N, N, O, T, X — that is 11 letters in total, where A repeats twice, I repeats twice, and N repeats twice. In alphabetical order, the first letter is A. So every dictionary word starting with A comes before the first word starting with E. We just need to count the words that start with A.

Formula Used

Number of permutations of \( n \) objects where objects repeat \( p, q, r, \dots \) times is \[ \frac{n!}{p!\, q!\, r! \cdots} \]

Solution

  1. Step 1: Write out the letters of EXAMINATION and count repetitions. The letters are A, A, E, I, I, M, N, N, O, T, X, giving \( 11 \) letters in all. Here A appears twice, I appears twice, and N appears twice; the rest (E, M, O, T, X) appear once each.
  2. Step 2: Arrange the distinct letters alphabetically: A, E, I, M, N, O, T, X. Since A comes first, any dictionary word beginning with A appears before every word beginning with E. So the words before the first E-word are exactly those that start with A.
  3. Step 3: Fix the first letter as A. This uses up one of the two A's. The remaining \( 10 \) letters to arrange are A, E, I, I, M, N, N, O, T, X.
  4. Step 4: In these remaining 10 letters, A now appears once, but I still appears twice and N still appears twice. So the number of arrangements is \[ \frac{10!}{2!\,2!} \]
  5. Step 5: Compute the value. Since \( 10! = 3628800 \) and \( 2! \times 2! = 4 \), we get \[ \frac{10!}{2!\,2!} = \frac{3628800}{4} = 907200 \]
  6. Step 6: Therefore, there are \( 907200 \) words that start with A, and all of these come before the first word that starts with E.

Final Answer

There are \( 907200 \) words in the list before the first word starting with E.

Common Mistake

A common mistake is dividing by \( 2!\,2!\,2! \) again after fixing A, forgetting that once one A is used as the first letter, only one A remains among the leftover 10 letters. The remaining repeats are only the two I's and two N's, so we divide by \( 2!\,2! \), not \( 2!\,2!\,2! \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify and count all letters of EXAMINATION: Write down every letter: A, A, E, I, I, M, N, N, O, T, X. Total letters = \( 11 \). The repeated letters are: A appears \( 2 \) times, I appears \( 2 \) times, N appears \( 2 \) times. The letters E, M, O, T, X each appear exactly once. — Reason: We must know the total count and repetitions before applying the permutation formula.
  2. Step 2: Arrange the distinct letters alphabetically: The distinct letters in alphabetical order are: A, E, I, M, N, O, T, X. — Reason: Dictionary order is alphabetical order, so identifying which letters come before E tells us which starting letters produce words that appear earlier in the list.
  3. Step 3: Identify which starting letters come before E: From the alphabetical list A, E, I, M, N, O, T, X, only A comes before E. So all words starting with A will appear in the dictionary list before the very first word starting with E. — Reason: Every word beginning with A is alphabetically smaller than every word beginning with E, so we only need to count words that start with A.
  4. Step 4: Fix the first letter as A and list the remaining letters: Place A in the first position. Since EXAMINATION has two A's, using one A at the front leaves the remaining \( 10 \) letters: A, E, I, I, M, N, N, O, T, X. Among these, I repeats \( 2 \) times and N repeats \( 2 \) times; all others appear once. — Reason: After fixing the first letter, we count arrangements of what is left to find the total number of words starting with A.
  5. Step 5: Apply the permutation formula to the remaining 10 letters: Number of distinct arrangements of the remaining \( 10 \) letters (with I twice and N twice): \[ \frac{10!}{2! \times 2!} \] Evaluating step by step: \( 10! = 3628800 \), \( 2! \times 2! = 2 \times 2 = 4 \). So: \[ \frac{3628800}{4} = 907200 \] — Reason: The formula accounts for the identical letters (I and I, N and N) that would otherwise produce duplicate arrangements.
  6. Step 6: Conclude the count: The total number of words in the dictionary list that come before the first word starting with E equals the number of words starting with A, which is \( 907200 \). — Reason: Since A is the only letter in EXAMINATION that is alphabetically before E, this single count gives us the complete answer.

Final Answer

There are \( 907200 \) words in the list before the first word starting with E.

Common Mistake

One common mistake: Students forget that EXAMINATION contains two A's, and they mistakenly subtract only one A from the remaining letters after fixing A at the start — but the correct remaining pool still contains one A, two I's, and two N's, giving a denominator of \( 2! \times 2! \), not \( 2! \times 2! \times 2! \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Letters of EXAMINATION (11 total): A(\( \times 2 \)), E, I(\( \times 2 \)), M, N(\( \times 2 \)), O, T, X. Alphabetically first letter is A, so count all words starting with A.
  2. Step 2: Fix first letter as A. Remaining 10 letters: A, E, I, I, M, N, N, O, T, X — with I(\( \times 2 \)), N(\( \times 2 \)).
  3. Step 3: Number of arrangements of remaining 10 letters: \[ \frac{10!}{2!\times 2!} = \frac{3628800}{4} = 907200 \]

Answer: There are \( 907200 \) words in the list before the first word starting with E.

➕ More Examples

More Examples

Example 1

Question: All different permutations of the letters of the word PROPORTION are listed as in a dictionary. How many words appear in this list before the first word starting with T?

Solution: Step 1: Identify the letters of PROPORTION and their frequencies. The word PROPORTION has 10 letters: P, R, O, P, O, R, T, I, O, N. Frequencies: P appears 2 times, R appears 2 times, O appears 3 times, T appears 1 time, I appears 1 time, N appears 1 time. Step 2: Identify letters that come before T in alphabetical order. The distinct letters are: I, N, O, P, R, T. Letters alphabetically before T are: I, N, O, P, R. Step 3: Count arrangements starting with each letter that comes before T. For each letter fixed at position 1, the remaining 9 letters are arranged, with the remaining frequencies adjusted accordingly. Case 1: First letter is I. Remaining 9 letters: P, R, O, P, O, R, O, T, N — frequencies: P(2), R(2), O(3), T(1), N(1). Number of arrangements: \[ \frac{9!}{2! \cdot 2! \cdot 3! \cdot 1! \cdot 1!} = \frac{362880}{2 \cdot 2 \cdot 6} = \frac{362880}{24} = 15120 \] Case 2: First letter is N. Remaining 9 letters: P, R, O, P, O, R, O, T, I — frequencies: P(2), R(2), O(3), T(1), I(1). Number of arrangements: \[ \frac{9!}{2! \cdot 2! \cdot 3! \cdot 1! \cdot 1!} = \frac{362880}{24} = 15120 \] Case 3: First letter is O. Remaining 9 letters: P, R, O, P, O, R, T, I, N — frequencies: P(2), R(2), O(2), T(1), I(1), N(1). Number of arrangements: \[ \frac{9!}{2! \cdot 2! \cdot 2! \cdot 1! \cdot 1! \cdot 1!} = \frac{362880}{2 \cdot 2 \cdot 2} = \frac{362880}{8} = 45360 \] Case 4: First letter is P. Remaining 9 letters: R, O, P, O, R, T, I, O, N — frequencies: R(2), O(3), P(1), T(1), I(1), N(1). Number of arrangements: \[ \frac{9!}{2! \cdot 3! \cdot 1! \cdot 1! \cdot 1! \cdot 1!} = \frac{362880}{2 \cdot 6} = \frac{362880}{12} = 30240 \] Case 5: First letter is R. Remaining 9 letters: P, O, P, O, T, I, O, N, R — frequencies: P(2), O(3), R(1), T(1), I(1), N(1). Number of arrangements: \[ \frac{9!}{2! \cdot 3! \cdot 1! \cdot 1! \cdot 1! \cdot 1!} = \frac{362880}{12} = 30240 \] Step 4: Add all cases. \[ 15120 + 15120 + 45360 + 30240 + 30240 = 136080 \]

Answer: 136080 words appear before the first word starting with T.

Example 2

Question: All different permutations of the letters of the word BALLOON are listed as in a dictionary. How many words appear in this list before the first word starting with O?

Solution: Step 1: Identify the letters of BALLOON and their frequencies. The word BALLOON has 7 letters: B, A, L, L, O, O, N. Frequencies: B(1), A(1), L(2), O(2), N(1). Step 2: Identify letters that come before O alphabetically. The distinct letters are: A, B, L, N, O. Letters alphabetically before O are: A, B, L, N. Step 3: Count arrangements starting with each such letter. For each letter fixed at position 1, arrange the remaining 6 letters. Case 1: First letter is A. Remaining 6 letters: B, L, L, O, O, N — frequencies: B(1), L(2), O(2), N(1). Number of arrangements: \[ \frac{6!}{1! \cdot 2! \cdot 2! \cdot 1!} = \frac{720}{1 \cdot 2 \cdot 2 \cdot 1} = \frac{720}{4} = 180 \] Case 2: First letter is B. Remaining 6 letters: A, L, L, O, O, N — frequencies: A(1), L(2), O(2), N(1). Number of arrangements: \[ \frac{6!}{1! \cdot 2! \cdot 2! \cdot 1!} = \frac{720}{4} = 180 \] Case 3: First letter is L. Remaining 6 letters: B, A, L, O, O, N — frequencies: B(1), A(1), L(1), O(2), N(1). Number of arrangements: \[ \frac{6!}{1! \cdot 1! \cdot 1! \cdot 2! \cdot 1!} = \frac{720}{2} = 360 \] Case 4: First letter is N. Remaining 6 letters: B, A, L, L, O, O — frequencies: B(1), A(1), L(2), O(2). Number of arrangements: \[ \frac{6!}{1! \cdot 1! \cdot 2! \cdot 2!} = \frac{720}{4} = 180 \] Step 4: Add all cases. \[ 180 + 180 + 360 + 180 = 900 \]

Answer: 900 words appear before the first word starting with O.

🎯 Try a Similar Question

Try a Similar Question

Question: If the different permutations of all the letters of the word MISSISSIPPI are listed as in a dictionary, how many words are there in this list before the first word starting with P?

Solution

  1. Step 1: Identify the letters in MISSISSIPPI and their frequencies: The word MISSISSIPPI has 11 letters. The letter frequencies are: M appears 1 time, I appears 4 times, S appears 4 times, P appears 2 times. Total letters = 11.
  2. Step 2: Identify letters that come before P in alphabetical order: Listing the distinct letters in MISSISSIPPI: I, M, P, S. In alphabetical order: I, M, P, S. Letters that come before P alphabetically are: I and M.
  3. Step 3: Count words starting with I: If the first letter is fixed as I, the remaining 10 letters are: M(1), I(3), S(4), P(2). The number of distinct arrangements of these 10 letters is: \[\frac{10!}{1!\, 3!\, 4!\, 2!}\] Calculating: \[\frac{3628800}{1 \times 6 \times 24 \times 2} = \frac{3628800}{288} = 12600\]
  4. Step 4: Count words starting with M: If the first letter is fixed as M, the remaining 10 letters are: I(4), S(4), P(2). The number of distinct arrangements of these 10 letters is: \[\frac{10!}{4!\, 4!\, 2!}\] Calculating: \[\frac{3628800}{24 \times 24 \times 2} = \frac{3628800}{1152} = 3150\]
  5. Step 5: Add the counts to get the total words before the first word starting with P: Total words before the first word starting with P = (words starting with I) + (words starting with M) \[= 12600 + 3150 = 15750\]

Answer: There are \( 15750 \) words in the list before the first word starting with P.

Everything you get with Solver7

More questions in Permutations and Combinations