SOLVER7 Study. Nothing Else.
Exercise 6.3 Q9(i)

How many words, with or without meaning can be made from the letters of the word \(MONDAY,\) assuming that no letter is repeated, if. \(4\) letters are used at a time,

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have 6 different coloured tiles, each with a letter from the word MONDAY. You want to pick any 4 of them and line them up in a row. The order matters — moving tiles around makes a completely different word. So swapping two tiles gives a brand new arrangement. Counting all the different rows you can make is exactly what this problem asks. The answer turns out to be 360 different 4-letter arrangements.

Answer: The number of 4-letter words that can be formed is \( {}^{6}P_{4} = 360 \).

📖 Words from MONDAY using 4 letters at a time

Detailed Explanation

The word MONDAY has 6 distinct letters: M, O, N, D, A, Y. Since no letter is repeated, forming a 4-letter word means we must choose 4 letters out of these 6 and then arrange them in a specific order. Because order matters (a word like MOND is different from DONM), this is a permutation problem, not just a combination. We use the permutation formula which counts the number of ordered arrangements of \( r \) objects taken from \( n \) distinct objects.

Formula Used

The number of permutations of \( n \) distinct objects taken \( r \) at a time is \[ {}^{n}P_{r} = \frac{n!}{(n-r)!} \]

Solution

  1. Step 1: Count the distinct letters in MONDAY. The letters are M, O, N, D, A, Y, and all are different. So the total number of letters is \( n = 6 \).
  2. Step 2: Identify how many letters are to be used at a time. Here we form words using 4 letters, so \( r = 4 \). Since order matters and no repetition is allowed, we use \( {}^{n}P_{r} \).
  3. Step 3: Apply the permutation formula with \( n = 6 \) and \( r = 4 \): \[ {}^{6}P_{4} = \frac{6!}{(6-4)!} = \frac{6!}{2!} \]
  4. Step 4: Expand the factorials. We know \[ 6! = 6 \times 5 \times 4 \times 3 \times 2! \] so the \( 2! \) cancels: \[ {}^{6}P_{4} = \frac{6 \times 5 \times 4 \times 3 \times 2!}{2!} = 6 \times 5 \times 4 \times 3 \]
  5. Step 5: Multiply out the remaining product: \[ 6 \times 5 = 30, \quad 30 \times 4 = 120, \quad 120 \times 3 = 360 \] So \( {}^{6}P_{4} = 360 \).

Final Answer

The number of 4-letter words that can be formed is \( {}^{6}P_{4} = 360 \).

Common Mistake

A common mistake is to use combinations \( {}^{6}C_{4} = 15 \) instead of permutations. Combinations only count the selection of letters and ignore their order, but here different orderings give different words, so permutations must be used.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: List every letter in the word MONDAY: M, O, N, D, A, Y. All six letters are distinct with no repeats, so \( n = 6 \). — Reason: We need to know the total pool of available letters before applying any formula.
  2. Step 2: We are forming 4-letter words, so exactly \( r = 4 \) letters are used at a time. Because MOND and DONM are counted as different words, order matters and no letter can be reused. — Reason: Recognising that order matters confirms this is a permutation, not a combination.
  3. Step 3: Substitute \( n = 6 \) and \( r = 4 \) into the permutation formula: \[ {}^{6}P_{4} = \frac{6!}{(6-4)!} = \frac{6!}{2!} \] — Reason: Plugging the values into \( {}^{n}P_{r} \) sets up the calculation we need to simplify.
  4. Step 4: Expand \( 6! \) only as far as needed, keeping \( 2! \) intact: \[ \frac{6!}{2!} = \frac{6 \times 5 \times 4 \times 3 \times 2!}{2!} \] The \( 2! \) cancels from numerator and denominator, leaving \[ 6 \times 5 \times 4 \times 3 \] — Reason: Cancelling common factorial terms avoids computing large numbers unnecessarily.
  5. Step 5: Carry out the multiplication step by step: \( 6 \times 5 = 30 \), then \( 30 \times 4 = 120 \), then \( 120 \times 3 = 360 \). Therefore \[ {}^{6}P_{4} = 360 \] — Reason: Breaking the product into smaller multiplications reduces arithmetic errors.

Final Answer

The number of 4-letter words that can be formed is \( {}^{6}P_{4} = 360 \).

Common Mistake

One common mistake: Using the combination formula \( {}^{6}C_{4} \) instead of \( {}^{6}P_{4} \). Combinations count selections where order does not matter, but here two arrangements of the same letters (e.g. MOND vs DONM) are different words, so order must be accounted for with permutations.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: MONDAY has 6 distinct letters, so \( n = 6 \), \( r = 4 \).
  2. Step 2: \[ {}^{6}P_{4} = \frac{6!}{(6-4)!} = \frac{6!}{2!} = \frac{6 \times 5 \times 4 \times 3 \times 2!}{2!} = 6 \times 5 \times 4 \times 3 \]
  3. Step 3: \[ 6 \times 5 \times 4 \times 3 = 360 \]

Answer: The number of 4-letter words that can be formed is \( {}^{6}P_{4} = 360 \).

➕ More Examples

More Examples

Example 1

Question: How many words, with or without meaning, can be formed using the letters of the word GARDEN, taken 4 at a time, assuming no letter is repeated?

Solution: The word GARDEN has 6 distinct letters: G, A, R, D, E, N. We need to form 4-letter words (arrangements) using these 6 distinct letters, with no repetition. This is a permutation problem where we select 4 letters out of 6 and arrange them. The number of such arrangements is given by: \[ {}^{6}P_{4} = \frac{6!}{(6 - 4)!} \] Simplifying the factorial expression: \[ {}^{6}P_{4} = \frac{6!}{2!} \] Expanding: \[ {}^{6}P_{4} = \frac{6 \times 5 \times 4 \times 3 \times 2!}{2!} \] Cancelling \( 2! \): \[ {}^{6}P_{4} = 6 \times 5 \times 4 \times 3 = 360 \] Therefore, the total number of 4-letter words that can be formed is 360.

Answer: 360

Example 2

Question: How many words, with or without meaning, can be formed from the letters of the word JOURNEY, if 5 letters are used at a time and no letter is repeated?

Solution: The word JOURNEY has 7 distinct letters: J, O, U, R, N, E, Y. We need to form 5-letter words (arrangements) using these 7 distinct letters, with no repetition. This is a permutation problem where we select 5 letters out of 7 and arrange them. The number of such arrangements is given by: \[ {}^{7}P_{5} = \frac{7!}{(7 - 5)!} \] Simplifying: \[ {}^{7}P_{5} = \frac{7!}{2!} \] Expanding the numerator: \[ {}^{7}P_{5} = \frac{7 \times 6 \times 5 \times 4 \times 3 \times 2!}{2!} \] Cancelling \( 2! \): \[ {}^{7}P_{5} = 7 \times 6 \times 5 \times 4 \times 3 \] Calculating step by step: \( 7 \times 6 = 42 \), then \( 42 \times 5 = 210 \), then \( 210 \times 4 = 840 \), then \( 840 \times 3 = 2520 \). \[ {}^{7}P_{5} = 2520 \] Therefore, the total number of 5-letter words that can be formed is 2520.

Answer: 2520

🎯 Try a Similar Question

Try a Similar Question

Question: How many words, with or without meaning, can be formed using the letters of the word CAPTAIN, assuming no letter is repeated, if 3 letters are used at a time? (Note: treat all letters of CAPTAIN as distinct by considering only its unique letters.)

Solution

  1. Step 1: Identify the distinct letters: The word CAPTAIN has letters: C, A, P, T, A, I, N. The repeated letter is A. The distinct letters are: C, A, P, T, I, N — a total of 6 distinct letters.
  2. Step 2: Set up the permutation: We need to form 3-letter words from these 6 distinct letters, with no letter repeated. The number of such words is given by \( {}^{6}P_{3} \).
  3. Step 3: Apply the formula: Using the permutation formula \( {}^{n}P_{r} = \frac{n!}{(n-r)!} \), we get: \[ {}^{6}P_{3} = \frac{6!}{(6-3)!} = \frac{6!}{3!} \]
  4. Step 4: Compute the factorials: We compute: \[ \frac{6!}{3!} = \frac{720}{6} = 120 \]
  5. Step 5: State the result: Therefore, the total number of 3-letter words that can be formed from the distinct letters of CAPTAIN is \( 120 \).

Answer: The number of 3-letter words that can be formed is \( {}^{6}P_{3} = 120 \).

Everything you get with Solver7

More questions in Permutations and Combinations