SOLVER7 Study. Nothing Else.
Exercise 6.1 Q3

How many \(4\)-letter code can be formed using the first \(10\) letters of the English alphabet, if no letter can be repeated \(?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have 10 different coloured beads and you want to pick 4 of them to make a bracelet. The order matters — a red-blue-green-yellow bracelet is different from a blue-red-green-yellow one. For the first spot you have 10 choices, then 9 remain, then 8, then 7. Multiply all those choices together. That gives you the total number of different 4-letter codes you can make from the first 10 letters of the alphabet without repeating any letter.

Answer: The number of 4-letter codes is \( {}^{10}P_{4} = 5040 \).

📖 Forming 4-Letter Codes Without Repetition

Detailed Explanation

Here we must form a 4-letter code from the first 10 letters of the English alphabet, namely \( \{a, b, c, d, e, f, g, h, i, j\} \). Since a code depends on the ORDER of the letters (for example, \( abcd \) is a different code from \( bacd \)), this is a problem of PERMUTATIONS. Also, since no letter can be repeated, each letter chosen is used only once. When we select and arrange \( r \) objects out of \( n \) distinct objects, the number of ways is given by the permutation formula. Another way to think about it is the fundamental principle of counting: fill each of the 4 positions one at a time, and multiply the choices.

Formula Used

\[ {}^{n}P_{r} = \frac{n!}{(n-r)!} \]

Solution

  1. Step 1: Identify \( n \) and \( r \). We have \( 10 \) available letters, so \( n = 10 \). We must form a code of \( 4 \) letters, so \( r = 4 \).
  2. Step 2: Recognise that order matters and no letter repeats, so we use permutations. The required number of codes is \( {}^{10}P_{4} \).
  3. Step 3: Apply the formula: \[ {}^{10}P_{4} = \frac{10!}{(10-4)!} = \frac{10!}{6!} \]
  4. Step 4: Expand and cancel \( 6! \): \[ \frac{10!}{6!} = 10 \times 9 \times 8 \times 7 \]
  5. Step 5: Multiply the values: \[ 10 \times 9 \times 8 \times 7 = 5040 \]
  6. Step 6: You can also see this using the counting principle: the 1st position has \( 10 \) choices, the 2nd has \( 9 \), the 3rd has \( 8 \), and the 4th has \( 7 \) (each choice reduces the pool by one). Multiplying gives \( 10 \times 9 \times 8 \times 7 = 5040 \).

Final Answer

The number of 4-letter codes is \( {}^{10}P_{4} = 5040 \).

Common Mistake

A common mistake is using combinations \( {}^{10}C_{4} \) instead of permutations. Combinations ignore order, but a code like \( abcd \) is different from \( dcba \), so order matters and permutations must be used.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: List the available letters. The first 10 letters of the English alphabet are \( \{a, b, c, d, e, f, g, h, i, j\} \), giving us \( n = 10 \) choices in total. — Reason: Identifying the pool of available letters tells us the value of \( n \) in the permutation formula.
  2. Step 2: Note that we need to form a code of 4 letters, so \( r = 4 \). — Reason: The value of \( r \) is the number of positions we need to fill.
  3. Step 3: Recognise that order matters (for example, \( abcd \) and \( bacd \) are different codes) and no letter may be repeated. This means we must use permutations, so the count is \( {}^{10}P_{4} \). — Reason: Permutations are used when arrangement order is significant and each item can be selected at most once.
  4. Step 4: Apply the permutation formula with \( n = 10 \) and \( r = 4 \): \[ {}^{10}P_{4} = \frac{10!}{(10 - 4)!} = \frac{10!}{6!} \] — Reason: Substituting into \( {}^{n}P_{r} = \frac{n!}{(n-r)!} \) sets up the calculation.
  5. Step 5: Cancel \( 6! \) from numerator and denominator by expanding only the top factors down to 7: \[ \frac{10!}{6!} = 10 \times 9 \times 8 \times 7 \] — Reason: Cancelling \( 6! \) avoids computing large factorials and leaves only four factors to multiply.
  6. Step 6: Multiply the remaining factors step by step. First, \( 10 \times 9 = 90 \). Next, \( 90 \times 8 = 720 \). Finally, \( 720 \times 7 = 5040 \). So \[ {}^{10}P_{4} = 5040 \] — Reason: Carrying out the arithmetic gives the total number of distinct 4-letter codes.
  7. Step 7: Verify using the Fundamental Principle of Counting: the 1st position has \( 10 \) choices, the 2nd has \( 9 \) (one letter used), the 3rd has \( 8 \), and the 4th has \( 7 \). Multiplying gives \( 10 \times 9 \times 8 \times 7 = 5040 \). — Reason: This alternative approach confirms the answer and reinforces why the permutation formula works.

Final Answer

The number of 4-letter codes is \( {}^{10}P_{4} = 5040 \).

Common Mistake

One common mistake: treating the problem as a combination (using \( {}^{10}C_{4} \)) and ignoring that different arrangements of the same letters produce different codes — always check whether order matters before choosing between permutations and combinations.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \( n = 10 \), \( r = 4 \), order matters, no repetition. Required: \( {}^{10}P_{4} \)
  2. Step 2: \[ {}^{10}P_{4} = \frac{10!}{(10-4)!} = \frac{10!}{6!} = 10 \times 9 \times 8 \times 7 \]
  3. Step 3: \[ 10 \times 9 \times 8 \times 7 = 5040 \]

Answer: The number of 4-letter codes is \( {}^{10}P_{4} = 5040 \).

➕ More Examples

More Examples

Example 1

Question: How many 3-letter codes can be formed using the first 8 letters of the English alphabet, if no letter can be repeated?

Solution: We need to form 3-letter codes from 8 distinct letters (a, b, c, d, e, f, g, h) without repetition. Here, the total number of available letters is \( n = 8 \) and the number of letters to be chosen for each code is \( r = 3 \). Using the permutation formula: \[ {}^{n}P_{r} = \frac{n!}{(n - r)!} \] Substituting \( n = 8 \) and \( r = 3 \): \[ {}^{8}P_{3} = \frac{8!}{(8 - 3)!} = \frac{8!}{5!} \] Expanding: \[ {}^{8}P_{3} = \frac{8 \times 7 \times 6 \times 5!}{5!} = 8 \times 7 \times 6 \] Calculating: \[ {}^{8}P_{3} = 336 \] Alternatively, using the Fundamental Principle of Counting: the first position can be filled in 8 ways, the second in 7 ways (one letter used), and the third in 6 ways (two letters used), giving \( 8 \times 7 \times 6 = 336 \).

Answer: 336

Example 2

Question: A security system generates 5-digit PIN codes using the digits 1 through 9 (i.e., the first 9 positive integers), with no digit repeated. How many such PIN codes are possible?

Solution: We need to form 5-digit codes from 9 distinct digits (1, 2, 3, 4, 5, 6, 7, 8, 9) without repetition. Here, the total number of available digits is \( n = 9 \) and the number of digits to be selected for each PIN is \( r = 5 \). Using the permutation formula: \[ {}^{n}P_{r} = \frac{n!}{(n - r)!} \] Substituting \( n = 9 \) and \( r = 5 \): \[ {}^{9}P_{5} = \frac{9!}{(9 - 5)!} = \frac{9!}{4!} \] Expanding: \[ {}^{9}P_{5} = \frac{9 \times 8 \times 7 \times 6 \times 5 \times 4!}{4!} = 9 \times 8 \times 7 \times 6 \times 5 \] Calculating step by step: \( 9 \times 8 = 72 \), then \( 72 \times 7 = 504 \), then \( 504 \times 6 = 3024 \), then \( 3024 \times 5 = 15120 \). \[ {}^{9}P_{5} = 15120 \] So there are 15120 possible PIN codes.

Answer: 15120

🎯 Try a Similar Question

Try a Similar Question

Question: How many 3-letter codes can be formed using the first 12 letters of the English alphabet, if no letter can be repeated?

Solution

  1. Step 1: Identify the values of n and r: We are choosing 3 letters (order matters, no repetition) from the first 12 letters of the English alphabet. So we have \( n = 12 \) and \( r = 3 \).
  2. Step 2: Apply the Permutation Formula: The number of 3-letter codes is given by \( {}^{12}P_{3} \). Using the formula: \[ {}^{n}P_{r} = \frac{n!}{(n - r)!} \] we substitute \( n = 12 \) and \( r = 3 \): \[ {}^{12}P_{3} = \frac{12!}{(12 - 3)!} = \frac{12!}{9!} \]
  3. Step 3: Simplify the Expression: Expanding the factorial: \[ \frac{12!}{9!} = \frac{12 \times 11 \times 10 \times 9!}{9!} = 12 \times 11 \times 10 \]
  4. Step 4: Calculate the Result: Multiplying step by step: \[ 12 \times 11 = 132 \] Then: \[ 132 \times 10 = 1320 \] So the total number of 3-letter codes is \( 1320 \).

Answer: The number of 3-letter codes is \( {}^{12}P_{3} = 1320 \).

Everything you get with Solver7

More questions in Permutations and Combinations