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
CBSE Class 11 Maths · Permutations and Combinations
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.
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.
Number of permutations of \( n \) objects where objects repeat \( p, q, r, \dots \) times is \[ \frac{n!}{p!\, q!\, r! \cdots} \]
There are \( 907200 \) words in the list before the first word starting with E.
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! \).
There are \( 907200 \) words in the list before the first word starting with E.
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! \).
Answer: There are \( 907200 \) words in the list before the first word starting with E.
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.
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.
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?
Answer: There are \( 15750 \) words in the list before the first word starting with P.