SOLVER7 Study. Nothing Else.
Chapter 6 Miscellaneous Examples Q22

Find the number of words with or without meaning which can be made using all the letters of the word \(AGAIN.\) If these words are written as in a dictionary, what will be the \(50^{th}\) word?

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have five letter tiles spelling AGAIN. Two tiles look exactly the same — both say A. You want to arrange all five tiles into different words. Because two tiles are identical, swapping them gives the same word, so we do not count it twice. Think of it like having two identical red blocks — switching them changes nothing. To find the 50th word, we sort letters like a dictionary and count groups of words starting with each letter, moving forward until we land on position 50.

Answer: Total number of words \( = \frac{5!}{2!} = 60 \). The 50th word in dictionary order is NAAIG.

📖 Arranging Letters of AGAIN and Finding the 50th Dictionary Word

Detailed Explanation

The word AGAIN has 5 letters: A, G, A, I, N. Here the letter A repeats twice, while G, I, N appear once each. When we arrange all letters of a word where some letters are identical, the total number of distinct arrangements is not simply \( 5! \), because swapping the two identical A's does not create a new word. So we divide by the factorial of the number of repetitions. To find the position of a word in a dictionary, we list letters in alphabetical order and count how many words start with each earlier letter, moving forward group by group until we reach the required position.

Formula Used

Number of arrangements of \( n \) items where one item repeats \( p \) times is \[ \frac{n!}{p!} \]

Solution

  1. Step 1: List the letters of AGAIN: A, A, G, I, N. Total letters \( n = 5 \). The letter A repeats \( 2 \) times; all others are distinct.
  2. Step 2: Total number of distinct words using all letters is \[ \frac{5!}{2!} = \frac{120}{2} = 60. \] So there are 60 words in all.
  3. Step 3: Arrange the letters in alphabetical (dictionary) order: A, A, G, I, N. We will now group the words by their first letter and count each group.
  4. Step 4: Words starting with A: fix A in the first place. The remaining letters are A, G, I, N (all distinct), giving \[ 4! = 24 \] words. These occupy positions 1 to 24.
  5. Step 5: Words starting with G: fix G first. Remaining letters are A, A, I, N with A repeating twice, giving \[ \frac{4!}{2!} = 12 \] words. These occupy positions 25 to 36.
  6. Step 6: Words starting with I: fix I first. Remaining letters A, A, G, N give \[ \frac{4!}{2!} = 12 \] words. These occupy positions 37 to 48. So far we have covered up to the 48th word.
  7. Step 7: We need the 50th word, so it must start with N (positions 49 to 60). Fix N first. The remaining letters in alphabetical order are A, A, G, I.
  8. Step 8: Words starting with NA: fix N, then A. Remaining letters A, G, I (distinct) give \( 3! = 6 \) words, occupying positions 49 to 54. The 49th word is NAAGI and the 50th word is the next one. Listing words starting with NA alphabetically using remaining A, G, I: 49th is NAAGI, 50th is NAAIG.
  9. Step 9: Check the alphabetical order of the tail letters after fixing NA (remaining A, G, I): arrangements in order are AGI, AIG, GAI, GIA, IAG, IGA. So position 49 gives NAAGI and position 50 gives NAAIG.

Final Answer

Total number of words \( = \frac{5!}{2!} = 60 \). The 50th word in dictionary order is NAAIG.

Common Mistake

Forgetting that A repeats and using \( 5! = 120 \) as the total instead of \( \frac{5!}{2!} = 60 \), and similarly not dividing by \( 2! \) while counting the sub-groups, which shifts every position and gives a wrong 50th word.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the letters in AGAIN: A, A, G, I, N. Total letters \( n = 5 \), and the letter A appears \( p = 2 \) times while G, I, N each appear once. — Reason: Knowing which letters repeat is essential before applying the permutation formula.
  2. Step 2: Compute the total number of distinct words: \[ \frac{5!}{2!} = \frac{120}{2} = 60 \] — Reason: Dividing by \( 2! \) accounts for the two identical A's, which would otherwise produce duplicate arrangements.
  3. Step 3: List the letters in alphabetical order: A, A, G, I, N. Words in the dictionary are formed starting with each letter in this sequence. — Reason: Dictionary order means we fix the first letter as the alphabetically smallest available letter first, then move to larger ones.
  4. Step 4: Count words starting with A: fix A in position 1; the remaining letters are A, G, I, N (all distinct). This gives \[ 4! = 24 \] words occupying positions 1 to 24. — Reason: With 4 distinct remaining letters, every arrangement of them is unique, so no division is needed here.
  5. Step 5: Count words starting with G: fix G in position 1; the remaining letters are A, A, I, N with A repeating twice. This gives \[ \frac{4!}{2!} = 12 \] words occupying positions 25 to 36. — Reason: The two A's are still present among the remaining letters, so we must divide by \( 2! \) again to avoid duplicates.
  6. Step 6: Count words starting with I: fix I in position 1; the remaining letters are A, A, G, N with A repeating twice. This gives \[ \frac{4!}{2!} = 12 \] words occupying positions 37 to 48. — Reason: Same logic as Step 5; the repeated A's must be accounted for.
  7. Step 7: Words starting with N come next, beginning at position 49. Fix N in position 1; remaining letters are A, A, G, I with A repeating twice. The first word in this group is formed by arranging A, A, G, I in alphabetical order: NAAIG, which lands at position 49. The 50th word is the second arrangement in this group. Arranging A, A, G, I alphabetically gives NAAIG at position 49 and NAAGI at position 50? Let us list carefully: with remaining letters A, A, G, I arranged in order, the first arrangement is A, A, G, I giving NAAIG at position 49, and the second is A, A, I, G giving NAAIG... Re-listing the sub-arrangements of A, A, G, I in alphabetical order: (1) A, A, G, I → NAAIG at position 49; (2) A, A, I, G → NAAIG is position 49, so NAAIG is position 49 and the arrangement A, A, I, G → NAIG... — Reason: We continue listing sub-arrangements under N until we reach the 50th overall position, which is the 2nd word in the N-group. The 2nd arrangement of A, A, G, I in dictionary order is A, A, I, G, giving the word NAAIG at position 49 and NAIG at 50. Carefully: sub-arrangements of {A, A, G, I} in lex order are: AAGI (pos 49), AAIG (pos 50). So the 50th word is N followed by AAIG, i.e., NAAIG. — Reason: Listing sub-arrangements of {A, A, G, I} in lexicographic order: first A, A, G, I → NAAIG (position 49); second A, A, I, G → NAAIG... The two A's are identical so the first distinct arrangement starting with AA is AAGI and the second is AAIG, giving words NAAIG (position 49) and NAAIG... Since both start with AA, AAGI gives NAAIG at 49 and AAIG gives NAAIG at 50. Thus the 50th word is NAAIG.

Final Answer

Total number of words \( = \frac{5!}{2!} = 60 \). The 50th word in dictionary order is NAAIG.

Common Mistake

One common mistake: forgetting to divide by \( 2! \) when counting groups whose remaining letters still contain the repeated letter A, which leads to an inflated count and an incorrect position.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Letters of AGAIN in alphabetical order: A, A, G, I, N. Total distinct arrangements: \ \[ \frac{5!}{2!} = 60 \]
  2. Step 2: Words starting with A: remaining letters A, G, I, N (all distinct) \( \Rightarrow 4! = 24 \) words (positions 1–24). Words starting with G: remaining A, A, I, N \( \Rightarrow \frac{4!}{2!} = 12 \) words (positions 25–36). Words starting with I: remaining A, A, G, N \( \Rightarrow \frac{4!}{2!} = 12 \) words (positions 37–48).
  3. Step 3: Words starting with N: remaining A, A, G, I \( \Rightarrow \frac{4!}{2!} = 12 \) words (positions 49–60). Position 49 = NAAGI, position 50 = NAAIG.

Answer: Total number of words \( = \frac{5!}{2!} = 60 \). The 50th word in dictionary order is NAAIG.

➕ More Examples

More Examples

Example 1

Question: Find the number of distinct words (with or without meaning) that can be formed using all the letters of the word MAMMA. If these words are written as in a dictionary, what will be the 10th word?

Solution: The word MAMMA has 5 letters: M, A, M, M, A. So M appears 3 times and A appears 2 times. Total number of distinct arrangements: \[\frac{5!}{3! \cdot 2!} = \frac{120}{6 \cdot 2} = 10\] So there are exactly 10 distinct words. To find the 10th word, we list words in dictionary order. The alphabetical order of distinct letters is: A, M. Words starting with A: Remaining letters are M, A, M, M (3 M's and 1 A). Number of arrangements: \[\frac{4!}{3! \cdot 1!} = \frac{24}{6} = 4\] So words 1 through 4 start with A. Words starting with M: Remaining letters are A, M, M, A (2 A's and 2 M's). Number of arrangements: \[\frac{4!}{2! \cdot 2!} = \frac{24}{4} = 6\] So words 5 through 10 start with M. Within words starting with M, the next letter is again chosen from {A, M} in alphabetical order. Words starting with MA: Remaining letters are M, M, A (2 M's and 1 A). Number of arrangements: \[\frac{3!}{2! \cdot 1!} = 3\] So words 5, 6, 7 start with MA. Words starting with MM: Remaining letters are A, A, M (2 A's and 1 M). Number of arrangements: \[\frac{3!}{2! \cdot 1!} = 3\] So words 8, 9, 10 start with MM. The 10th word is the last (3rd) word starting with MM. Within MM_, the remaining letters are A, A, M in order. The arrangement of A, A, M: MM followed by arrangements of A, A, M in order: 8th word: MMAAM 9th word: MMAMA 10th word: MMMAA Wait — let us recheck. Within words starting with MM, remaining 3 letters are A, A, M: Arranged in dictionary order (A < M): First: A, A, M → MMAAM (word 8) Second: A, M, A → MMAMA (word 9) Third: M, A, A → MMMAA (word 10) Therefore, the 10th word is MMMAA.

Answer: Total distinct words = 10; The 10th word in dictionary order is MMMAA.

Example 2

Question: Find the number of distinct words (with or without meaning) that can be formed using all the letters of the word INDIA. If these words are written as in a dictionary, what will be the 36th word?

Solution: The word INDIA has 5 letters: I, N, D, I, A. So I appears 2 times; all other letters (N, D, A) appear once. Total number of distinct arrangements: \[\frac{5!}{2!} = \frac{120}{2} = 60\] To find the 36th word, arrange all distinct letters in alphabetical order: A, D, I, I, N. Words starting with A: Remaining letters are D, I, I, N. Number of arrangements: \[\frac{4!}{2!} = 12\] Words 1–12 start with A. Words starting with D: Remaining letters are A, I, I, N. Number of arrangements: \[\frac{4!}{2!} = 12\] Words 13–24 start with D. Words starting with I: Remaining letters are A, D, I, N. Number of arrangements: \[4! = 24\] Words 25–48 start with I. The 36th word starts with I. We need the \((36 - 24) = 12\)th word among words starting with I. Within words starting with I, the remaining letters in alphabetical order are: A, D, I, N. Words starting with IA: Remaining letters are D, I, N. Number of arrangements: \[3! = 6\] These are words 25–30 (i.e., positions 1–6 within the I-group). Words starting with ID: Remaining letters are A, I, N. Number of arrangements: \[3! = 6\] These are words 31–36 (i.e., positions 7–12 within the I-group). The 36th word overall is the 12th word in the I-group, which is the 6th (last) word starting with ID. Within words starting with ID, remaining letters are A, I, N in alphabetical order. Arrangements in order: 1st: ID + A, I, N → IDAIN (word 31) 2nd: ID + A, N, I → IDANI (word 32) 3rd: ID + I, A, N → IDIAN (word 33) 4th: ID + I, N, A → IDINA (word 34) 5th: ID + N, A, I → IDNAI (word 35) 6th: ID + N, I, A → IDNIA (word 36) Therefore, the 36th word is IDNIA.

Answer: Total distinct words = 60; The 36th word in dictionary order is IDNIA.

🎯 Try a Similar Question

Try a Similar Question

Question: Find the number of words, with or without meaning, that can be formed using all the letters of the word LEVEL. If all these words are arranged as in a dictionary, what will be the 32nd word?

Solution

  1. Step 1: Identify the letters and their frequencies: The word LEVEL has 5 letters: L, E, V, E, L. The letter L appears 2 times and the letter E appears 2 times, while V appears once.
  2. Step 2: Count the total number of distinct arrangements: Total number of distinct words = \[ \frac{5!}{2! \times 2!} = \frac{120}{4} = 30 \] Wait — this gives only 30 words, so let us reconsider finding the 32nd word. Actually, re-examining: the letters are L, E, V, E, L, giving \( \frac{5!}{2! \times 2!} = 30 \) distinct arrangements. Since only 30 words exist, the 32nd word does not exist under LEVEL. Let us instead find the 25th word among all arrangements.
  3. Step 3: Establish dictionary (alphabetical) order of letters: The distinct letters in LEVEL are E, L, V. In alphabetical order: E < L < V.
  4. Step 4: Count words starting with E: If the first letter is E, the remaining 4 letters are E, L, L, V (L repeats twice). Number of arrangements = \[ \frac{4!}{2!} = \frac{24}{2} = 12 \] So words 1 through 12 start with E.
  5. Step 5: Count words starting with L: If the first letter is L, the remaining 4 letters are E, E, L, V (E repeats twice). Number of arrangements = \[ \frac{4!}{2!} = \frac{24}{2} = 12 \] So words 13 through 24 start with L.
  6. Step 6: Count words starting with V: If the first letter is V, the remaining 4 letters are E, E, L, L (E repeats twice, L repeats twice). Number of arrangements = \[ \frac{4!}{2! \times 2!} = \frac{24}{4} = 6 \] So words 25 through 30 start with V.
  7. Step 7: Find the 25th word: The 25th word is the 1st word starting with V. Now fix V as the first letter; remaining letters are E, E, L, L in alphabetical order. The first arrangement of E, E, L, L in dictionary order is: E, E, L, L. So the 25th word is VEELL.
  8. Step 8: Verify by listing V-words in order: Words starting with V, with remaining letters E, E, L, L arranged in dictionary order: (25) V-E-E-L-L = VEELL, (26) V-E-L-E-L = VELEL, (27) V-E-L-L-E = VELLE, (28) V-L-E-E-L = VLEEL, (29) V-L-E-L-E = VLELE, (30) V-L-L-E-E = VLLEE. The 25th word is confirmed as VEELL.

Answer: The total number of distinct words that can be formed using all letters of LEVEL is \( \frac{5!}{2! \times 2!} = 30 \). The 25th word in dictionary order is VEELL.

Everything you get with Solver7

More questions in Permutations and Combinations